Adams WP, Sherali HD (1993) Mixed-integer bilinear programming problems. Math Program 59(3):279–306Adams WP, Sherali HD (1993) Mixed-integer bilinear programming problems. Math Program 59(3):279–305Adams, W.P., Sherali, H.D.: Mixed-integer bilinear programming problems. Math. Progr. ...
bilinear problems, McCormick envelopes, binary expansion, cutting planes, mixed integer programming AMS subject classifications. 1. Introduction. Consider the mixed integer bilinear program given as min ˆ x T Q 0 ˆ y +f T 0 ˆ x +g...
Mixed-integer programmingGlobal optimizationConvex hullDisjunctive cutSplit cutSplit-rankWe study the facet defining inequalities of the convex hull of a mixed-integer bilinear covering arising in trim-loss (or cutting stock) problem under the framework of disjunctive cuts. We show that all of them ...
Zeng, B., An, Y., Kuznia, L.: Chance constrained mixed integer program: Bilinear and linear formulations, and Benders decomposition. Optimization Online. 2014.B. Zeng, Y. An, and K. Ludwig, "Chance constrained mixed integer program: Bilinear and linear formulations, and benders decomposition,...
Non-ConvexMixed-IntegerNonlinearProgramming:ASurveySamuelBurer∗AdamN.Letchford†28thFebruary2012AbstractAwiderangeofproblemsarising..
or cutting planes. These linearized problems are then solved with an mixed-integer linear programming (MILP) solver such as CPLEX, Gurobi or Cbc. If CPLEX or Gurobi is used, the subproblems can also include quadratic and bilinear nonlinearities directly; then MIQP or MIQCQP subproblems are ...
The case of bilinear bilevel problems is discussed in Section 4, where we focus on pricing problems and Stackelberg games. In Section 5, we then turn to bilevel problems with mixed-integer (non)linear lower-level problems. Also for these problems, we first focus on general properties before...
Then, the corresponding bilinear programming (BLP) problem requires a relaxation on the bilinear Solution algorithm The MILP problem can be solved efficiently by various optimization routines, e.g., CPLEX solver. The VI constraints in Eq. (31) are defined from a set of all extreme points (S)...
This paper proposes a global approach for solving mixed 0-1 programming problems containing convex or separable continuous functions. Given a mixed 0-1 polynomial term z = x1x2... xng(Y) where x1, x2,..., xn are 0-1 integer variables and g(Y) is a convex or a separable continuous...
mixed-integer nonlinear programmingglobal optimizationprimal heuristicsportfolios of relaxationsThis work considers the global optimization of general non-convex nonlinear and mixed-integer nonlinear programming MINLP problems with underlying bilinear substructures. We combine reformulation–linearization techniques and...