Non-convex mixed-integer nonlinear programming : a survey [PDF]
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core +4 more sources
Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation [PDF]
A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Progamming (ILP) formulation Mixed Integer Programming (MIP) formulation is presented. An ILP stated as a system of linear
Hadjiconstantinou, E
core +6 more sources
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core +4 more sources
Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]
Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core +5 more sources
Information complexity of mixed-integer convex optimization
We investigate the information complexity of mixed-integer convex optimization under different types of oracles. We establish new lower bounds for the standard first-order oracle, improving upon the previous best known lower bound. This leaves only a lower order linear term (in the dimension) as the gap between the lower and upper bounds.
Amitabh Basu +3 more
openaire +4 more sources
Disjunctive cuts in Mixed-Integer Conic Optimization
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization condition on its resolution. In particular, we show that a careful selection of normalization guarantees its solvability
Lodi A., Tanneau M., Vielma J. -P.
openaire +6 more sources
Another pedagogy for mixed-integer Gomory
We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a “dual form” mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm.
Jon Lee, Angelika Wiegele
doaj +1 more source
A Mixed-Integer Optimization Formulation for Buyers Formation
Companies frequently offer wholesale prices for their products that decrease with the number of purchased items. However, single buyers may not be willing or able to purchase large quantities of a single item. Nevertheless, consumers can form groups to purchase at wholesale prices, obtaining bargaining power.
Dávila-Gálvez, Sebastián +4 more
openaire +3 more sources
New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core +7 more sources
Discrete and mixed-variable experimental design with surrogate-based approach† [PDF]
Experimental design plays an important role in efficiently acquiring informative data for system characterization and deriving robust conclusions under resource limitations.
Mengjia Zhu +6 more
doaj +1 more source

