Advances in CPLEX for Mixed Integer Nonlinear Optimization
|
|
- Austin Walters
- 5 years ago
- Views:
Transcription
1 Pierre Bonami and Andrea Tramontani IBM ILOG CPLEX ISMP Pittsburgh - July Advances in CPLEX for Mixed Integer Nonlinear Optimization IBM Corporation
2 CPLEX Optimization Studio is available now! DoCloud services: OPL on the cloud. Performance improvements to CPO CPLEX Optimizer performance: IBM Corporation
3 CPLEX Optimization Studio is available now! DoCloud services: OPL on the cloud. Performance improvements to CPO CPLEX Optimizer performance: Exploit symmetry for LP Cuts for non-convex (MI)QP Improvements for SOCP Improvement to convex MIQCP/MISOCP IBM Corporation
4 CPLEX Optimization Studio is available now! DoCloud services: OPL on the cloud. Performance improvements to CPO CPLEX Optimizer performance: Exploit symmetry for LP Cuts for non-convex (MI)QP Improvements for SOCP Improvement to convex MIQCP/MISOCP Nonconvex (MI)QP > 0 sec 395 Models > 1 sec 134 Models IBM Corporation
5 CPLEX Optimization Studio is available now! DoCloud services: OPL on the cloud. Performance improvements to CPO CPLEX Optimizer performance: Exploit symmetry for LP Cuts for non-convex (MI)QP Improvements for SOCP Improvement to convex MIQCP/MISOCP Nonconvex (MI)QP > 0 sec 395 Models > 1 sec 134 Models IBM Corporation
6 Convex MIQCP and MISOCP min c T x x T Q k x +ak Tx a0 k Ax = b, x j Z k = 1,...,m, j = 1,...,p. (MIQCP) Where all quadratic constraints can be represented as second order cones: L d := {(x,x 0 ) R d+1 : d i=1 x 2 i x 2 0,x 0 0}. (L d defines the (d + 1)-dimensional second order cone.) IBM Corporation
7 Second order cone representability Through basic transformations can model: Convex quadratic constraints: x T Qx +a T x a 0, with Q 0 Rotated second order cones: d xi 2 x 0 x 1, with x 0,x 1 0 or more complicated... i=2 x T Qx +a T x c T x +b, with Q 0 Second Order Cone Programming (p = 0) Solved efficiently by interior point methods Supported by many commercial solvers (CPLEX in particular). CPLEX automatically recognizes and reformulates convex quadratics, rotated SOC, but not every form IBM Corporation
8 MISOCP min c T x (x Ji,x hi ) L d i i = 1,...,m Ax = b, x j Z j = 1,...,p. (MISOCP) Algorithms are based on SOCP relaxation. Convex MINLP algorithms work with some added technicality due to non-differentiability [Drewes, 2009, Drewes and Ulbrich, 2012]. Supported by most commercial MIP solvers (CPLEX in particular) IBM Corporation
9 Agenda The basic algorithms in CPLEX SOCP-BB OA-BB Comparisons in CPLEX Novelties of CPLEX Cone disaggregation Lift-and-project for MISOCP Comparisons of CPLEX vs IBM Corporation
10 SOCP based branch-and-bound Straightforward generalization of main MILP algorithm: solve an SOCP at each node of the tree IBM Corporation
11 SOCP based branch-and-bound Straightforward generalization of main MILP algorithm: solve an SOCP at each node of the tree. Branch on variables with fractional value. integer feasible infeasible fathomed by bound IBM Corporation
12 SOCP based branch-and-bound Straightforward generalization of main MILP algorithm: solve an SOCP at each node of the tree. Branch on variables with fractional value. Prune by infeasibility, bounds and integer feasibility. integer feasible infeasible fathomed by bound IBM Corporation
13 Outer Approximation [Duran and Grossmann, 1986] min c T x s.t. g i (x) 0 Ax = b x j Z, i = 1,...,m, j = 1,...,p. Idea: Take first-order approximations of constraints at different points and build an equivalent MILP IBM Corporation
14 Outer Approximation [Duran and Grossmann, 1986] min c T x s.t. g i (x) 0 Ax = b x j Z, i = 1,...,m, j = 1,...,p. Idea: Take first-order approximations of constraints at different points and build an equivalent MILP. min c T x s.t. g i (x k )+ g i (x k ) T (x x k ) 0 x j Z, i = 1,...,m, k = 1,...,K j = 1,...,p IBM Corporation
15 OA Branch-and-cut [Quesada and Grossmann, 1992] Initialize by solving SOCP relaxation and taking OA s at the optimum. At each integer feasible node: integer feasible IBM Corporation
16 OA Branch-and-cut [Quesada and Grossmann, 1992] Initialize by solving SOCP relaxation and taking OA s at the optimum. At each integer feasible node: 1 solve SOCP with integers fixed, and enrich the set of linearizations. 2 Resolve the LP relaxation of the node with the new cuts. 3 Repeat as long as node is integer feasible. integer feasible IBM Corporation
17 OA Branch-and-cut [Quesada and Grossmann, 1992] Initialize by solving SOCP relaxation and taking OA s at the optimum. At each integer feasible node: 1 solve SOCP with integers fixed, and enrich the set of linearizations. 2 Resolve the LP relaxation of the node with the new cuts. 3 Repeat as long as node is integer feasible. Never prune by integer feasibility. integer feasible IBM Corporation
18 The MISOCP solver in CPLEX Implements two main algorithms; choice controled by parameter CPXPARAM_MIP_Strategy_MIQCPStrat SOCP based Branch-and-bound (miqcpstrat 1). LP based branch-and-cut (miqcpstrat 2). Default (miqcpstrat 0) is deciding which of the two to run in a clever way. History of MISOCP with CPLEX class p algorithm V. (Year) SOCP 0 barrier 9.0 (2003) MISOCP > 0 SOCP based B&B 9.0 (2003) LP based B&C 11.0 (2007) Cone propagations (2014) IBM Corporation
19 Comparing OA and SOCP BB s in CPLEX % model solved 225 models solved by at least one method and failed by none. Default strategy picked _miqcpstrat_0 1261_miqcpstrat_1 1261_miqcpstrat_ time factor OA 113 times SOCP-BB 46 times 56 models identical with both To be perfect should have picked 14 more models with OA 36 more models with SOCP-BB IBM Corporation
20 How bad can outer approximation be? Consider the following convex MIQCP: min s.t. c T x n ( ) i=1 xi n 1 (1) 4 x Z n z (1) is infeasible: The ball is too small to contain integer points. It is large enough to touch every edge of the hypercube. x y IBM Corporation
21 Solving (1) with OA cuts z No OA constraint can cut 2 vertices of the hypercube. If an inequality cuts two vertices, it cuts the segment joining them. This can not be: the ball has non-empty intersection with any such segment. x y IBM Corporation
22 Solving (1) with OA cuts z No OA constraint can cut 2 vertices of the hypercube. If an inequality cuts two vertices, it cuts the segment joining them. This can not be: the ball has non-empty intersection with any such segment. An OA would need at least 2 n OA cuts to converge. x y IBM Corporation
23 Solving (1) with OA cuts z No OA constraint can cut 2 vertices of the hypercube. If an inequality cuts two vertices, it cuts the segment joining them. This can not be: the ball has non-empty intersection with any such segment. An OA would need at least 2 n OA cuts to converge. x Note: A basic SOCP branch-and-bound also enumerates at least 2 n integer sols. y IBM Corporation
24 Experimental illustration 2 CPLEX SCIP 2.1 Bonmin B-Hyb n 2 n nodes nodes nodes 10 1,024 2, , ,768 65,535 31, , ,048,576 2,097,151 1,216, CPLEX ran in single threaded mode 2 Three years ago I liked this slide IBM Corporation
25 Experimental illustration 2 Remark CPLEX SCIP 2.1 Bonmin B-Hyb n 2 n nodes nodes nodes 10 1,024 2, , ,768 65,535 31, , ,048,576 2,097,151 1,216, Problem is simple for CPLEX/SCIP if variables are 0 1: replace xi 2 by x i, the contradiction n 4 n 1 4 follows. 1 CPLEX ran in single threaded mode 2 Three years ago I liked this slide IBM Corporation
26 Experimental illustration 2 Remark CPLEX SCIP 2.1 Bonmin B-Hyb n 2 n nodes nodes nodes 10 1,024 2, , ,768 65,535 31, , ,048,576 2,097,151 1,216, Problem is simple for CPLEX/SCIP if variables are 0 1: replace xi 2 by x i, the contradiction n 4 n 1 4 follows. SCIP 3.0 and CPLEX solve it in a blink. 1 CPLEX ran in single threaded mode 2 Three years ago I liked this slide IBM Corporation
27 New in CPLEX Cone disaggregation for MISOCP Lift-and-project cuts for MISOCP Redesigned heuristic choice of most promising algorithm Updated history of MIQCP with CPLEX class p algorithm V. (Year) SOCP 0 barrier 9.0 (2003) MISOCP > 0 barrier based B&B 9.0 (2003) Outer approximation B&C 11.0 (2007) Cone propagations (2014) Major improvements (June 2015) IBM Corporation
28 Separable mixed integer convex programs min c T x s.t. g i (x) 0 i = 1,...,m Ax = b x j Z j = 1,...,p l x u (sminlp) For i = 1,...,m, g i are convex separable: g i (x) = with g ij : [l j,u j ] R convex. n g ij (x j ) j= IBM Corporation
29 Disaggregated formulation Introduce one variable y ij for each elementary function: min s.t. c T x n y ij 0 j=1 g ij (x j ) y ij Ax = b, x i Z l x u. i = 1,...,m, i = 1,...,m, j = 1,...,n, i = 1,...,p, (sminlp ) IBM Corporation
30 Cone disaggregation for MISOCP In standard form the nonlinear constraint describing the second order cone is not convex separable: n xi 2 x0 2 i=1 [Vielma et al., 2015] (go to FC24!), divide the constraint by x 0 0 to get a convex separable constraint: n i=1 Now introduce y 1,...,y n and rewrite as: x 2 i x 0 x 0. n y i x 0 i=1 x 2 i x 0 y i IBM Corporation
31 Extended formulation of (1) Application to (1) [Hijazi et al., 14] z min c T x n s.t. y i (n 1)/4 i=1 (x i 0.5) 2 y i i = 1,...,n x Z n. Its outer approximation min c T x n s.t. y i (n 1)/4 i=1 2 ( x k i 0.5 ) (x i x k i )+ ( x k i 0.5 ) 2 yi i = 1,...,n k = 1,...,K x Z n x y IBM Corporation
32 Extended formulation of (1) min c T x n s.t. y i (n 1)/4 i=1 Application to (1) [Hijazi et al., 14] (x i 0.5) 2 y i i = 1,...,n x Z n. Its outer approximation min c T x n s.t. y i (n 1)/4 i=1 2 ( x k i 0.5 ) (x i x k i )+ ( x k i 0.5 ) 2 yi i = 1,...,n k = 1,...,K x Z n IBM Corporation
33 Extended formulation of (1) Application to (1) [Hijazi et al., 14] min c T x 2 points suffice to make the mixed-integer set infeasible n x 1 = 0 and x 2 = 1: s.t. y i (n 1)/4 x i y i i = 1,...,n i=1 (x i 0.5) 2 x i y y i i = 1,...,n i i = 1,...,n y i 0.25 x Z n x. i Z Its outer approximation min c T x n s.t. y i (n 1)/4 i=1 2 ( x k i 0.5 ) (x i x k i )+ ( x k i 0.5 ) 2 yi i = 1,...,n k = 1,...,K x Z n IBM Corporation
34 Lift-and-project cuts for MISOCP Cuts are an essential component of MILP solvers Can always apply MILP cuts to a linear OA of MISOCP (and we do it) Can we generate better cuts by looking directly at nonlinear functions? A partial answer: as long as the cut generated is linear it could also have been obtained from a linear outer approximation In the past three years, tremendous activity towards conic cuts for conic programming [Andersen and Jensen, 2013, Belotti et al., 2013, Kılınç-Karzan and Yıldız, 2015, Modaresi et al., 2015] (among others) Our goal Derive linear cutting planes Fast Find an appropriate OA from which to derive a cut IBM Corporation
35 Split Relaxation Consider C and M := C (Z p R n p ). Let π Z p {0} n p, π 0 Z and ( C (π,π0) := conv C ({ x : π T } x π 0 { x : π T x π })). α T x = β ˆx C (π,π0) (clearly M C (π,π 0) C). π T x π 0 π T x π IBM Corporation
36 Two approaches from Mixed Integer Convex Programming Goal: build a linear OA from which a "best" cut can be deduced. Use Disjunctive Programming for MILP to derive the cuts. Using only LP [Kılınc et al., 2011]. Using nonlinear programming [Bonami, 2011] 1 Start with any linear OA of C 1 Solve a single NLP that tells if ˆx is in the split relaxation. 2 Solve a Cut Generation LP, if a cut if found STOP. 3 Deduce from dual of CGLP two points proving that ˆx is in the split relaxation. 4 If point(s) not in C generate new OA and goto 2, otherwise there is no cut, STOP. 2 If not, deduce from solution two points such that ˆx = λx 1 +(1 λ)x 0 and closest to the disjunction. 3 Build OA around these two points. 4 Solve MLP and get the cut IBM Corporation
37 Lift-and-project for MISOCP Hybridizing the approaches of [Kılınc et al., 2011] and [Bonami, 2011] From [Kılınc et al., 2011] Pure LP approach, Dynamic generation of additional OA constraints. ˆx From [Bonami, 2011] compact formulation using MLP, penalization of the non-linear constraints. π T x π0 π T x π IBM Corporation
38 Lift-and-project for MISOCP Hybridizing the approaches of [Kılınc et al., 2011] and [Bonami, 2011] From [Kılınc et al., 2011] Pure LP approach, Dynamic generation of additional OA constraints. ˆx From [Bonami, 2011] compact formulation using MLP, penalization of the non-linear constraints. π T x π0 π T x π IBM Corporation
39 Lift-and-project for MISOCP Hybridizing the approaches of [Kılınc et al., 2011] and [Bonami, 2011] From [Kılınc et al., 2011] Pure LP approach, Dynamic generation of additional OA constraints. ˆx x 1 x 0 From [Bonami, 2011] compact formulation using MLP, penalization of the non-linear constraints. π T x π0 π T x π IBM Corporation
40 Lift-and-project for MISOCP Hybridizing the approaches of [Kılınc et al., 2011] and [Bonami, 2011] From [Kılınc et al., 2011] Pure LP approach, Dynamic generation of additional OA constraints. ˆx x 1 x 0 From [Bonami, 2011] compact formulation using MLP, penalization of the non-linear constraints. π T x π0 π T x π IBM Corporation
41 Lift-and-project for MISOCP Hybridizing the approaches of [Kılınc et al., 2011] and [Bonami, 2011] From [Kılınc et al., 2011] Pure LP approach, Dynamic generation of additional OA constraints. ˆx x 1 x 0 From [Bonami, 2011] compact formulation using MLP, penalization of the non-linear constraints. π T x π0 π T x π IBM Corporation
42 How good can this be? z [Cornuéjols and Li, 2001] showed that the empty ball in dimension n has split rank n (also holds for any outer approximation in this space) Practically unsolvable using any form of split cuts (even conic ones). x y Instead the OA of the disaggregated formulation has (simple) split rank IBM Corporation
43 How good can this be? z [Cornuéjols and Li, 2001] showed that the empty ball in dimension n has split rank n (also holds xfor i + any 0.25outer y i i = 1,...,n approximation inx i this space) y i i = 1,...,n Practically unsolvable using any form y i 0.25 x of split cuts (even i 0 OR x conic ones). i 1 x y Instead the OA of the disaggregated formulation has (simple) split rank 1. y i 1 4 x i 0 x i IBM Corporation
44 A more complicated empty ellipse n (100x2i x2i 1 2 4x 2i x 2i 1 98x 2i 98x 2i 1 ) 1 i=1 x Z 2n Results on 12 threads with , and aggressive cuts 3, 3 hours time limit n nodes nodes nodes 5 2,261 2,045 1, ,97, > 23,125,426 7,769 1 (Largest model solved in 2.2 sec by , in 5.5 sec by ) 3 set mip limit cutpasses set mip cuts liftproj 3 set mip strategy miqcpstrat IBM Corporation
45 A more complicated empty ellipse Similar results previously observed by [Kılınç, 2011] Original Extended n root gap sol time root gap sol time Batch n Markowitz (100x2i x2i x> 2i x10 2i x 2i x 2i 1 1) i=1 SLay uflquad x Z 2n SeeResults also related on 12theoretical threads with results , for MILP case and [Boduraggressive et al., 2015] cuts and, 3go hours to FD01. time limit n nodes nodes nodes 5 2,261 2,045 1, ,97, > 23,125,426 7,769 1 (Largest model solved in 2.2 sec by , in 5.5 sec by ) IBM Corporation
46 Remarks Cone disaggregation Automatically applied by default during presolve, Only interesting (and done): 1 If using the OA-BB, 2 For cones that are long enough. Lift-and-project Also only done in OA based algorithm. Still an expensive algorithm (may not speed up every easy model). Also... Redesigned heuristic to choose algorithm to apply in view of these changes IBM Corporation
47 Computational experiments MISOCP Test bed Cplex internal MIQCP test bed: 296 models Benchmarks test set of CBLIB ( 80 models Compare the new release Cplex against Cplex : geo. mean of branch-and-bound computing times. Compare the two algorithmic strategies SOCP-BB and OA-BB in Cplex All tests are carried on Linux machines: Intel 2.67 GHz, 24 GB RAM, 12 threads, deterministic IBM Corporation
48 CPLEX vs > 0 sec 231 Models > 1 sec 149 Models > 0 sec 66 Models > 1 sec 46 Models CPLEX test bed CPLEX : 62 time limits CPLEX : 38 time limits CBLIB CPLEX : 17 time limits CPLEX : 8 time limits IBM Corporation
49 Comparing OA and SOCP BB s in CPLEX % model solved 245 models solved by at least one method and failed by none. Default strategy picked _miqcpstrat_0 1262_miqcpstrat_1 1262_miqcpstrat_ time factor OA-BB 186 times SOCP-BB 4 times 55 models identical with both To be perfect should have picked 2 more models with OA-BB 9 more models with SOCP-BB IBM Corporation
50 Reminder of CPLEX % model solved 225 models solved by at least one method and failed by none. Default strategy picked _miqcpstrat_0 1261_miqcpstrat_1 1261_miqcpstrat_ time factor OA 113 times SOCP-BB 46 times 56 models identical with both To be perfect should have picked 14 more models with OA 36 more models with SOCP-BB IBM Corporation
51 Other CPLEX and CPO related Failure-directed Search for Constraint-based Scheduling P. Vilím, Monday 11:20 (MB25) Symmetry in Linear Programming R. Wunderling, Tuesday 10:20 (TB07) Accelerating the Development of Efficient CP Optimizer Models P. Laborie, Tuesday 14:45 (TD19) Advances in the CPLEX Distributed Solver L. Ladanyi, Thursday 13:10 (ThC15) On Mathematical Programming with Indicator Constraints A. Lodi, Thursday 16:35 (ThE01) Max Clique Cuts for Standard Quadratic Programs J. Schweiger, Friday 10:50 (FB29) Zero-Half Cuts for Solving Nonconvex Quadratic Programs with Box Constraints J. Linderoth, Friday 11:20 (FB29) IBM Corporation
52
53 Legal Disclaimer IBM Corporation All Rights Reserved. The information contained in this publication is provided for informational purposes only. While efforts were made to verify the completeness and accuracy of the information contained in this publication, it is provided AS IS without warranty of any kind, express or implied. In addition, this information is based on IBM s current product plans and strategy, which are subject to change by IBM without notice. IBM shall not be responsible for any damages arising out of the use of, or otherwise related to, this publication or any other materials. Nothing contained in this publication is intended to, nor shall have the effect of, creating any warranties or representations from IBM or its suppliers or licensors, or altering the terms and conditions of the applicable license agreement governing the use of IBM software. References in this presentation to IBM products, programs, or services do not imply that they will be available in all countries in which IBM operates. Product release dates and/or capabilities referenced in this presentation may change at any time at IBM s sole discretion based on market opportunities or other factors, and are not intended to be a commitment to future product or feature availability in any way. Nothing contained in these materials is intended to, nor shall have the effect of, stating or implying that any activities undertaken by you will result in any specific sales, revenue growth or other results. Performance is based on measurements and projections using standard IBM benchmarks in a controlled environment. The actual throughput or performance that any user will experience will vary depending upon many factors, including considerations such as the amount of multiprogramming in the user s job stream, the I/O configuration, the storage configuration, and the workload processed. Therefore, no assurance can be given that an individual user will achieve results similar to those stated here. IBM, the IBM logo, CPLEX and SPSS are trademarks of International Business Machines Corporation in the United States, other countries, or both. Intel, Intel Xeon are trademarks or registered trademarks of Intel Corporation or its subsidiaries in the United States and other countries. Linux is a registered trademark of Linus Torvalds in the United States, other countries, or both. Other company, product, or service names may be trademarks or service marks of others IBM Corporation
54 References I K. Andersen and A. Jensen. Intersection cuts for mixed integer conic quadratic sets. In M. Goemans and J. Correa, editors, Integer Programming and Combinatorial Optimization, volume 7801 of Lecture Notes in Computer Science, pages Springer Berlin Heidelberg, ISBN doi: / _4. URL P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky. On families of quadratic surfaces having fixed intersections with two hyperplanes. Discrete Applied Mathematics, 161(16 17): , ISSN X. doi: URL M. Bodur, S. Dash, and O. Günlük. Cutting planes from extended lp formulations. Technical report, P. Bonami. Lift-and-project cuts for mixed integer convex programs. In IPCO, pages 52 64, G. Cornuéjols and Y. Li. On the rank of mixed 0,1 polyhedra. In K. Aardal and B. Gerards, editors, Integer Programming and Combinatorial Optimization, volume 2081 of Lecture Notes in Computer Science, pages Springer Berlin Heidelberg, ISBN doi: / _6. URL S. Drewes. Mixed Integer Second Order Cone Programming. PhD thesis, Technische Universität Darmstadt, S. Drewes and S. Ulbrich. Subgradient based outer approximation for mixed integer second order cone programming. In J. Lee and S. Leyffer, editors, Mixed Integer Nonlinear Programming, volume 154 of The IMA Volumes in Mathematics and its Applications, pages Springer New York, ISBN doi: / _2. URL M. A. Duran and I. Grossmann. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36: , H. Hijazi, P. Bonami, and A. Ouorou. An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS Journal on Computing, 26(1):null, 14. doi: /ijoc M. Kılınc, J. Linderoth, and J. Luedtke. Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Technical Report 1681, M. R. Kılınç. Disjunctive Cutting Planes ann Algorithms for Convex Mixed Integer Nonlinear Programming. PhD thesis, University of Wisconsin-Madison, IBM Corporation
55 References II F. Kılınç-Karzan and S. Yıldız. Two term disjunctions on the second-order cone. Mathematical Programming, April S. Modaresi, M. Kılınç, and J. Vielma. Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Mathematical Programming, pages 1 37, ISSN doi: /s URL I. Quesada and I. E. Grossmann. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering, 16: , J. P. Vielma, I. Dunning, J. Huchette, and M. Lubin. Extended Formulations in Mixed Integer Conic Quadratic Programming. Research Report, IBM Corporation
56
Symmetry in Linear Programming
Roland Wunderling, Jean-Francois Puget ISMP 2015 Symmetry in Linear Programming CPLEX Optimization studio 12.6.2 is available now! DoCloud services: OPL on the cloud. Performance improvements to CPO CPLEX
More informationMINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms
MINLP: Theory, Algorithms, Applications: Lecture 3, Basics of Algorothms Jeff Linderoth Industrial and Systems Engineering University of Wisconsin-Madison Jonas Schweiger Friedrich-Alexander-Universität
More informationDisjunctive Cuts for Cross-Sections of the Second-Order Cone
Disjunctive Cuts for Cross-Sections of the Second-Order Cone Sercan Yıldız Gérard Cornuéjols June 10, 2014 Abstract In this paper we provide a unified treatment of general two-term disjunctions on crosssections
More informationIndicator Constraints in Mixed-Integer Programming
Indicator Constraints in Mixed-Integer Programming Andrea Lodi University of Bologna, Italy - andrea.lodi@unibo.it Amaya Nogales-Gómez, Universidad de Sevilla, Spain Pietro Belotti, FICO, UK Matteo Fischetti,
More informationSolving Mixed-Integer Nonlinear Programs
Solving Mixed-Integer Nonlinear Programs (with SCIP) Ambros M. Gleixner Zuse Institute Berlin MATHEON Berlin Mathematical School 5th Porto Meeting on Mathematics for Industry, April 10 11, 2014, Porto
More informationOn mathematical programming with indicator constraints
On mathematical programming with indicator constraints Andrea Lodi joint work with P. Bonami & A. Tramontani (IBM), S. Wiese (Unibo) University of Bologna, Italy École Polytechnique de Montréal, Québec,
More informationDisjunctive conic cuts: The good, the bad, and implementation
Disjunctive conic cuts: The good, the bad, and implementation MOSEK workshop on Mixed-integer conic optimization Julio C. Góez January 11, 2018 NHH Norwegian School of Economics 1 Motivation Goals! Extend
More informationMixed Integer Nonlinear Programming
ROADEF 2014 Bordeaux 26 févier 2014. 1 c 2014 IBM corportation Decision Optimization Mixed Integer Nonlinear Programming algorithms Pierre Bonami (and many co-authors) IBM ILOG CPLEX "The mother of all
More informationSplit cuts and extended formulations for Mixed Integer Conic Quadratic Programming
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.
More informationStructure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University Joint work with Sercan Yıldız
More informationFeasibility Pump for Mixed Integer Nonlinear Programs 1
Feasibility Pump for Mixed Integer Nonlinear Programs 1 Presenter: 1 by Pierre Bonami, Gerard Cornuejols, Andrea Lodi and Francois Margot Mixed Integer Linear or Nonlinear Programs (MILP/MINLP) Optimize
More informationSome Recent Advances in Mixed-Integer Nonlinear Programming
Some Recent Advances in Mixed-Integer Nonlinear Programming Andreas Wächter IBM T.J. Watson Research Center Yorktown Heights, New York andreasw@us.ibm.com SIAM Conference on Optimization 2008 Boston, MA
More informationA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mied Integer Conic Quadratic Programs Juan Pablo Vielma Shabbir Ahmed George L. Nemhauser H. Milton Stewart School of Industrial and Systems Engineering
More informationConstraint Qualification Failure in Action
Constraint Qualification Failure in Action Hassan Hijazi a,, Leo Liberti b a The Australian National University, Data61-CSIRO, Canberra ACT 2601, Australia b CNRS, LIX, Ecole Polytechnique, 91128, Palaiseau,
More informationA note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu
A note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu Juan Pablo Vielma, Shabbir Ahmed and George Nemhauser H. Milton Stewart School of Industrial and Systems
More informationA note on : A Superior Representation Method for Piecewise Linear Functions
A note on : A Superior Representation Method for Piecewise Linear Functions Juan Pablo Vielma Business Analytics and Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights,
More informationMixed Integer Programming Solvers: from Where to Where. Andrea Lodi University of Bologna, Italy
Mixed Integer Programming Solvers: from Where to Where Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it November 30, 2011 @ Explanatory Workshop on Locational Analysis, Sevilla A. Lodi, MIP
More informationMixed-Integer Nonlinear Decomposition Toolbox for Pyomo (MindtPy)
Mario R. Eden, Marianthi Ierapetritou and Gavin P. Towler (Editors) Proceedings of the 13 th International Symposium on Process Systems Engineering PSE 2018 July 1-5, 2018, San Diego, California, USA 2018
More informationLift-and-Project Cuts for Mixed Integer Convex Programs
Lift-and-Project Cuts for Mixed Integer Convex Programs Pierre Bonami LIF, CNRS Aix-Marseille Université, 163 avenue de Luminy - Case 901 F-13288 Marseille Cedex 9 France pierre.bonami@lif.univ-mrs.fr
More informationImproved quadratic cuts for convex mixed-integer nonlinear programs
Improved quadratic cuts for convex mixed-integer nonlinear programs Lijie Su a,b, Lixin Tang a*, David E. Bernal c, Ignacio E. Grossmann c a Institute of Industrial and Systems Engineering, Northeastern
More informationSplit Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of Technology University
More informationStrong-Branching Inequalities for Convex Mixed Integer Nonlinear Programs
Computational Optimization and Applications manuscript No. (will be inserted by the editor) Strong-Branching Inequalities for Convex Mixed Integer Nonlinear Programs Mustafa Kılınç Jeff Linderoth James
More informationDisjunctive Cuts for Mixed Integer Nonlinear Programming Problems
Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems Pierre Bonami, Jeff Linderoth, Andrea Lodi December 29, 2012 Abstract We survey recent progress in applying disjunctive programming theory
More informationSoftware for Integer and Nonlinear Optimization
Software for Integer and Nonlinear Optimization Sven Leyffer, leyffer@mcs.anl.gov Mathematics & Computer Science Division Argonne National Laboratory Roger Fletcher & Jeff Linderoth Advanced Methods and
More informationFrom structures to heuristics to global solvers
From structures to heuristics to global solvers Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies OR2013, 04/Sep/13, Rotterdam Outline From structures to
More informationSplit Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed Integer Programming Juan Pablo Vielma Massachusetts Institute of Technology joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of
More informationA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser, H. Milton Stewart School of Industrial and Systems
More informationStructure of Valid Inequalities for Mixed Integer Conic Programs
Structure of Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University 18 th Combinatorial Optimization Workshop Aussois, France January
More informationPERSPECTIVE REFORMULATION AND APPLICATIONS
PERSPECTIVE REFORMULATION AND APPLICATIONS OKTAY GÜNLÜK AND JEFF LINDEROTH Abstract. In this paper we survey recent work on the perspective reformulation approach that generates tight, tractable relaxations
More informationBasic notions of Mixed Integer Non-Linear Programming
Basic notions of Mixed Integer Non-Linear Programming Claudia D Ambrosio CNRS & LIX, École Polytechnique 5th Porto Meeting on Mathematics for Industry, April 10, 2014 C. D Ambrosio (CNRS) April 10, 2014
More informationTwo-Term Disjunctions on the Second-Order Cone
Noname manuscript No. (will be inserted by the editor) Two-Term Disjunctions on the Second-Order Cone Fatma Kılınç-Karzan Sercan Yıldız the date of receipt and acceptance should be inserted later Abstract
More informationMixed Integer Nonlinear Programming
Mixed Integer Nonlinear Programming IMA New Directions Short Course on Mathematical Optimization Jeff Linderoth and Jim Luedtke Department of Industrial and Systems Engineering University of Wisconsin-Madison
More informationMixed Integer Non Linear Programming
Mixed Integer Non Linear Programming Claudia D Ambrosio CNRS Research Scientist CNRS & LIX, École Polytechnique MPRO PMA 2016-2017 Outline What is a MINLP? Dealing with nonconvexities Global Optimization
More informationMixed Integer Programming:
Mixed Integer Programming: Analyzing 12 Years of Progress Roland Wunderling CPLEX Optimizer Architect Background 2001: Manfred Padberg s60 th birthday Bixby et al., Mixed-Integer Programming: A Progress
More informationLift-and-project cuts for convex mixed integer nonlinear programs. Linear programming based separation and extended formulations
Math. Prog. Comp. DOI 10.1007/s12532-017-0118-1 FULL LENGTH PAPER 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Lift-and-project cuts for convex mixed integer nonlinear programs Linear programming based separation
More informationOnline generation via offline selection - Low dimensional linear cuts from QP SDP relaxation -
Online generation via offline selection - Low dimensional linear cuts from QP SDP relaxation - Radu Baltean-Lugojan Ruth Misener Computational Optimisation Group Department of Computing Pierre Bonami Andrea
More informationHeuristics for nonconvex MINLP
Heuristics for nonconvex MINLP Pietro Belotti, Timo Berthold FICO, Xpress Optimization Team, Birmingham, UK pietrobelotti@fico.com 18th Combinatorial Optimization Workshop, Aussois, 9 Jan 2014 ======This
More informationConvex hull of two quadratic or a conic quadratic and a quadratic inequality
Noname manuscript No. (will be inserted by the editor) Convex hull of two quadratic or a conic quadratic and a quadratic inequality Sina Modaresi Juan Pablo Vielma the date of receipt and acceptance should
More informationA novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints
A novel branch-and-bound algorithm for quadratic mixed-integer problems with quadratic constraints Simone Göttlich, Kathinka Hameister, Michael Herty September 27, 2017 Abstract The efficient numerical
More informationOn handling indicator constraints in mixed integer programming
Comput Optim Appl (2016) 65:545 566 DOI 10.1007/s10589-016-9847-8 On handling indicator constraints in mixed integer programming Pietro Belotti 1 Pierre Bonami 2 Matteo Fischetti 3 Andrea Lodi 4,5 Michele
More informationCutting Planes and Elementary Closures for Non-linear Integer Programming
Cutting Planes and Elementary Closures for Non-linear Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute
More informationLocation and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization
Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization Amir Ahmadi-Javid, Oded Berman *, Pooya Hoseinpour Department of Industrial Engineering & Management
More informationA computational study of Gomory cut generators
A computational study of Gomory cut generators Gerard Cornuéjols 1, François Margot 1, Giacomo Nannicini 2 1. CMU Tepper School of Business, Pittsburgh, PA. 2. Singapore University of Technology and Design,
More information23. Cutting planes and branch & bound
CS/ECE/ISyE 524 Introduction to Optimization Spring 207 8 23. Cutting planes and branch & bound ˆ Algorithms for solving MIPs ˆ Cutting plane methods ˆ Branch and bound methods Laurent Lessard (www.laurentlessard.com)
More informationComputer Sciences Department
Computer Sciences Department Strong Branching Inequalities for Convex Mixed Integer Nonlinear Programs Mustafa Kilinc Jeff Linderoth James Luedtke Andrew Miller Technical Report #696 September 20 Strong
More informationStrengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Merve Bodur 1, Sanjeeb Dash 2, Otay Günlü 2, and James Luedte 3 1 Department of Mechanical and Industrial Engineering,
More informationA Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization
A Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization Sven Leyffer 2 Annick Sartenaer 1 Emilie Wanufelle 1 1 University of Namur, Belgium 2 Argonne National Laboratory, USA IMA Workshop,
More informationAn Integrated Approach to Truss Structure Design
Slide 1 An Integrated Approach to Truss Structure Design J. N. Hooker Tallys Yunes CPAIOR Workshop on Hybrid Methods for Nonlinear Combinatorial Problems Bologna, June 2010 How to Solve Nonlinear Combinatorial
More informationA Review and Comparison of Solvers for Convex MINLP
A Review and Comparison of Solvers for Convex MINLP Jan Kronqvist a, David E. Bernal b, Andreas Lundell c, and Ignacio E. Grossmann b a Process Design and Systems Engineering, Åbo Akademi University, Åbo,
More informationAnalyzing the computational impact of individual MINLP solver components
Analyzing the computational impact of individual MINLP solver components Ambros M. Gleixner joint work with Stefan Vigerske Zuse Institute Berlin MATHEON Berlin Mathematical School MINLP 2014, June 4,
More informationOutline. 1 Introduction. 2 Modeling and Applications. 3 Algorithms Convex. 4 Algorithms Nonconvex. 5 The Future of MINLP? 2 / 126
Outline 1 Introduction 2 3 Algorithms Convex 4 Algorithms Nonconvex 5 The Future of MINLP? 2 / 126 Larry Leading Off 3 / 126 Introduction Outline 1 Introduction Software Tools and Online Resources Basic
More informationThe IMA Volumes in Mathematics and its Applications Volume 154
The IMA Volumes in Mathematics and its Applications Volume 154 For further volumes: http://www.springer.com/series/811 Institute for Mathematics and its Applications (IMA) The Institute for Mathematics
More informationComputing with multi-row Gomory cuts
Computing with multi-row Gomory cuts Daniel G. Espinoza Departamento de Ingeniería Industrial, Universidad de Chile, Av. República 71, Santiago, 837-439, Chile Abstract Recent advances on the understanding
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationOrbital Conflict. Jeff Linderoth. Jim Ostrowski. Fabrizio Rossi Stefano Smriglio. When Worlds Collide. Univ. of Wisconsin-Madison
Orbital Conflict When Worlds Collide Jeff Linderoth Univ. of Wisconsin-Madison Jim Ostrowski University of Tennessee Fabrizio Rossi Stefano Smriglio Univ. of L Aquila MIP 2014 Columbus, OH July 23, 2014
More informationOn Handling Indicator Constraints in Mixed Integer Programming
On Handling Indicator Constraints in Mixed Integer Programming Pietro Belotti 1, Pierre Bonami 2, Matteo Fischetti 3, Andrea Lodi 4, Michele Monaci 3, Amaya Nogales-Gómez 5, and Domenico Salvagnin 3 1
More informationSome cut-generating functions for second-order conic sets
Some cut-generating functions for second-order conic sets Asteroide Santana 1 and Santanu S. Dey 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology June 1, 2016 Abstract
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
More informationGestion de la production. Book: Linear Programming, Vasek Chvatal, McGill University, W.H. Freeman and Company, New York, USA
Gestion de la production Book: Linear Programming, Vasek Chvatal, McGill University, W.H. Freeman and Company, New York, USA 1 Contents 1 Integer Linear Programming 3 1.1 Definitions and notations......................................
More informationAn Empirical Evaluation of a Walk-Relax-Round Heuristic for Mixed Integer Convex Programs
Noname manuscript No. (will be inserted by the editor) An Empirical Evaluation of a Walk-Relax-Round Heuristic for Mixed Integer Convex Programs Kuo-Ling Huang Sanjay Mehrotra Received: date / Accepted:
More informationCuts for Conic Mixed-Integer Programming
Cuts for Conic Mixed-Integer Programming Alper Atamtürk and Vishnu Narayanan Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720-1777 USA atamturk@berkeley.edu,
More informationMIXED INTEGER PROGRAMMING APPROACHES FOR NONLINEAR AND STOCHASTIC PROGRAMMING
MIXED INTEGER PROGRAMMING APPROACHES FOR NONLINEAR AND STOCHASTIC PROGRAMMING A Thesis Presented to The Academic Faculty by Juan Pablo Vielma Centeno In Partial Fulfillment of the Requirements for the
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationDisjunctive Inequalities: Applications and Extensions
Disjunctive Inequalities: Applications and Extensions Pietro Belotti Leo Liberti Andrea Lodi Giacomo Nannicini Andrea Tramontani 1 Introduction A general optimization problem can be expressed in the form
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationProjected Perspective Reformulations for NonLinear Network Design Problems
Projected Perspective Reformulations for NonLinear Network Design Problems Antonio Frangioni Claudio Gentile Enrico Grande Andrea Pacifici Dipartimento di Informatica, Università di Pisa Polo Universitario
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationDecision Diagrams for Discrete Optimization
Decision Diagrams for Discrete Optimization Willem Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Acknowledgments: David Bergman, Andre Cire, Samid
More informationComputational Experiments with Cross and Crooked Cross Cuts
Computational Experiments with Cross and Crooked Cross Cuts Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com Juan Pablo Vielma Massachusetts Institute of Technology
More informationEffective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs
Effective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs Mustafa Kılınç Jeff Linderoth James Luedtke Department of Industrial and Systems Engineering University of Wisconsin-Madison
More informationDevelopment of the new MINLP Solver Decogo using SCIP - Status Report
Development of the new MINLP Solver Decogo using SCIP - Status Report Pavlo Muts with Norman Breitfeld, Vitali Gintner, Ivo Nowak SCIP Workshop 2018, Aachen Table of contents 1. Introduction 2. Automatic
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
More informationAlternative Methods for Obtaining. Optimization Bounds. AFOSR Program Review, April Carnegie Mellon University. Grant FA
Alternative Methods for Obtaining Optimization Bounds J. N. Hooker Carnegie Mellon University AFOSR Program Review, April 2012 Grant FA9550-11-1-0180 Integrating OR and CP/AI Early support by AFOSR First
More informationSemidefinite Relaxations for Non-Convex Quadratic Mixed-Integer Programming
Semidefinite Relaxations for Non-Convex Quadratic Mixed-Integer Programming Christoph Buchheim 1 and Angelika Wiegele 2 1 Fakultät für Mathematik, Technische Universität Dortmund christoph.buchheim@tu-dortmund.de
More informationHot-Starting NLP Solvers
Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio
More informationOptimization in Process Systems Engineering
Optimization in Process Systems Engineering M.Sc. Jan Kronqvist Process Design & Systems Engineering Laboratory Faculty of Science and Engineering Åbo Akademi University Most optimization problems in production
More informationPolyhedral Approach to Integer Linear Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Polyhedral Approach to Integer Linear Programming Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh 1 / 30 Brief history First Algorithms Polynomial Algorithms Solving
More informationLecture 2. Split Inequalities and Gomory Mixed Integer Cuts. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 2 Split Inequalities and Gomory Mixed Integer Cuts Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh Mixed Integer Cuts Gomory 1963 Consider a single constraint
More informationCan Li a, Ignacio E. Grossmann a,
A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables Can Li a, Ignacio E. Grossmann
More informationBilevel Integer Optimization: Theory and Algorithms
: Theory and Algorithms Ted Ralphs 1 Joint work with Sahar Tahernajad 1, Scott DeNegre 3, Menal Güzelsoy 2, Anahita Hassanzadeh 4 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University
More informationOn optimizing over lift-and-project closures
Math. Prog. Comp. manuscript No. (will be inserted by the editor) On optimizing over lift-and-project closures Pierre Bonami the date of receipt and acceptance should be inserted later Abstract The strengthened
More informationEvent-based MIP models for the resource constrained project scheduling problem
Event-based MIP models for the resource constrained project scheduling problem Oumar Koné, Christian Artigues, Pierre Lopez LAAS-CNRS, Université de Toulouse, France Marcel Mongeau IMT, Université de Toulouse,
More informationTightening a Discrete Formulation of the Quadratic Assignment Problem
A publication of 1309 CHEMICAL ENGINEERING TRANSACTIONS VOL. 32, 2013 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Copyright 2013, AIDIC Servizi S.r.l., ISBN 978-88-95608-23-5; ISSN 1974-9791 The Italian
More informationSolving nonconvex MINLP by quadratic approximation
Solving nonconvex MINLP by quadratic approximation Stefan Vigerske DFG Research Center MATHEON Mathematics for key technologies 21/11/2008 IMA Hot Topics Workshop: Mixed-Integer Nonlinear Optimization
More informationCutting Planes in SCIP
Cutting Planes in SCIP Kati Wolter Zuse-Institute Berlin Department Optimization Berlin, 6th June 2007 Outline 1 Cutting Planes in SCIP 2 Cutting Planes for the 0-1 Knapsack Problem 2.1 Cover Cuts 2.2
More informationCan Li a, Ignacio E. Grossmann a,
A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables Can Li a, Ignacio E. Grossmann
More informationThe Surprisingly Complicated Case of [Convex] Quadratic Optimization
The Surprisingly Complicated Case of [Convex] Quadratic Optimization Robert Fourer 4er@ampl.com AMPL Optimization Inc. www.ampl.com +1 773-336-AMPL U.S.-Mexico Workshop on Optimization and Its Applications
More informationAn Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse
An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University
More informationIBM Research Report. A Feasibility Pump for Mixed Integer Nonlinear Programs
RC386 (W060-09) February, 006 Mathematics IBM Research Report A Feasibility Pump for Mied Integer Nonlinear Programs Pierre Bonami, Gérard Cornuéjols, Andrea Lodi*, François Margot Tepper School of Business
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationValid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints
Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints Nilay Noyan Andrzej Ruszczyński March 21, 2006 Abstract Stochastic dominance relations
More informationInformation-Based Branching Schemes for Binary Linear Mixed Integer Problems
Information-Based Branching Schemes for Binary Linear Mixed Integer Problems Fatma Kılınç Karzan, George L. Nemhauser, Martin W.P. Savelsbergh H. Milton Stewart Industrial and Systems Engineering, Georgia
More informationOptimizing Convex Functions over Non-Convex Domains
Optimizing Convex Functions over Non-Convex Domains Daniel Bienstock and Alexander Michalka University Berlin 2012 Introduction Generic Problem: min Q(x), s.t. x F, Introduction Generic Problem: min Q(x),
More informationA hard integer program made easy by lexicography
Noname manuscript No. (will be inserted by the editor) A hard integer program made easy by lexicography Egon Balas Matteo Fischetti Arrigo Zanette October 12, 2010 Abstract A small but notoriously hard
More informationComputer Sciences Department
Computer Sciences Department Solving Large Steiner Triple Covering Problems Jim Ostrowski Jeff Linderoth Fabrizio Rossi Stefano Smriglio Technical Report #1663 September 2009 Solving Large Steiner Triple
More informationStochastic Integer Programming
IE 495 Lecture 20 Stochastic Integer Programming Prof. Jeff Linderoth April 14, 2003 April 14, 2002 Stochastic Programming Lecture 20 Slide 1 Outline Stochastic Integer Programming Integer LShaped Method
More informationConvex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Projected Formulations
Anureet Saxena Pierre Bonami Jon Lee Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Projected Formulations November 19, 008 Abstract A common way to produce a convex
More information