The piecewise linear optimization polytope: New inequalities and intersection with semi-continuous constraints

Mathematical Programming

Volumn 141, Issue 1-2, 2013, Pages 217-255

  Zhao, Ming ^a   De Farias Jr , Ismael Regis ^b  

^a SAS INSTITUTE INC   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Branch and cut; Knapsack problem; Mixed integer programming; Piecewise linear optimization; Polyhedral method; Semi continuous variables; Special ordered set

Indexed keywords

BRANCH-AND-CUT; KNAPSACK PROBLEMS; MIXED-INTEGER PROGRAMMING; ORDERED SET; PIECEWISE LINEAR; POLYHEDRAL METHOD; SEMI-CONTINUOUS;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; PIECEWISE LINEAR TECHNIQUES;

OPTIMIZATION;

EID: 84884676023     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0517-z     Document Type: Article

References (48)

1. Bazaraa M.S.; Sherali H.D.; Shetty C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, London (2006)
2. Beale, E.M.L.:Two transportation problems. In: Kreweras, G.; Morlat, G. (eds.) Proceedings of the Third International Conference on Operational Research, pp. 780-788. Dunod, Paris (1963)
3. Beale E.M.L.: Mathematical Programming in Practice. Pitmans, London (1968)
4. Beale, E.M.L.: Branch-and-bound methods in mathematical programming systems. In: Hammer, P.L.; Johnson, E.L.; Korte, B.H. (eds.) Annals of Discrete Mathematics 5: Discrete Optimization, pp. 201-219. North Holland (1979)
5. Beale, E.M.L.: Branch and bound methods for numerical optimization. In:Barrit, M.M.; Wishart, D. (eds.) COMPSTAT 80: Proceedings in Computational Statistics, pp. 11-20. Physica Verlag, Vienna (1980)
6. Beale, E.M.L.:Integer programming. In: Sciitkowski, K. (ed.) Computational Mathematical Programming, NATO ASI Series, vol. f15, pp. 1-24. Springer, Berlin (1985)
7. Beale, E.M.L.; Tomlin, J.A.:Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the Fifth International Conference on Operations Research, pp. 447-454. Tavistock Publications (1970)
8. Biegler L.T.; Grossmann I.E.; Westerberg A.W.: Systematic Methods of Chemical Process Design. Prentice Hall, Englewood Cliffs (1997)
9. Bienstock D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121-140 (1996) (Pubitemid 126407431)
10. Bradley S.P.; Hax A.C.; Magnanti T.L.: Applied Mathematical Programming. Addison-Wesley, Reading (1977)
11. Chien M.J.; Kuh E.S.: Solving nonlinear resistive networks using piecewise linear analysis and simplicial subdivision. IEEE Trans. Circuits Syst. 24, 305-317 (1977)
12. Crowder H.; Johnson E.L.; Padberg M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803-834 (1983) (Pubitemid 14489280)
13. Croxton K.L.; Gendron B.; Magnanti T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Manag. Sci. 49, 1268-1273 (2003)
14. Croxton K.L.; Gendron B.; Magnanti T.L.: Models and methods for merge-in-transit operations. Transp. Sci. 37, 1-22 (2003)
15. Croxton, K.L.; Gendron, B.; Magnanti, T.L.: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Operations Research Center, Massachusetts Institute of Technology (2003)
16. D'Ambrosio C.; Lodi A.; Martello S.: Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38, 39-46 (2010)
17. Dantzig G.B.: On the significance of solving linear programming problems with some integer variables. Econometrica 28, 30-44 (1960)
18. de Farias, I.R. Jr.: Semi-continuous cuts for mixed-integer programming. In: Bienstock, D.; Nemhauser, G.L. (eds.) Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 3064, pp. 163-177. Springer, Berlin (2004) (Pubitemid 39740030)
19. de Farias, I.R. Jr.; Gupta, R.; Kozyreff, E.; Zhao, M.: Branch-and-Cut for Separable Piecewise Linear Optimization and Intersection with Semi-Continuous Constraints. Texas Tech University (2011)
20. de Farias I.R.; Johnson E.L.; Nemhauser G.L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187-203 (2000)
21. de Farias I.R.; Johnson E.L.; Nemhauser G.L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16, 25-39 (2001) (Pubitemid 33691668)
22. de Farias I.R.; Nemhauser G.L.: A family of inequalities for the generalized assignment problem. Oper. Res. Lett. 29, 49-51 (2001) (Pubitemid 32775921)
23. de Farias I.R.; Nemhauser G.L.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96, 439-467 (2003)
24. de Farias, I.R. Jr.; Zhao, M.: A Polyhedral Study of the Semi-Continuous Knapsack Problem. Texas Tech University (2011)
25. de Farias I.R.; Zhao M.; Zhao H.: A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36, 234-238 (2008) (Pubitemid 351258131)
26. Eaves B.C.: Homotopies for computation of fixed points. Math. Program. 3, 1-22 (1972)
27. Fourer R.; Gay D.M.; Kerninghan B.W.: AMPL - a modeling language for mathematical programming. The Scientific Press, Redwood City (1993)
28. Fügenschuh A.; Göttlich S.; Martin A.: A discrete optimization approach to large scale supply networks based on partial differential equations. SIAM J. Sci. Comput. 30, 1490-1507 (2008)
29. Graf T.; van Hentenryck P.; Lasserre C.; Zimmer L.: Simulation of hybrid circuits in constraint logic programming. Comput. Math. Appl. 20, 45-56 (1990)
30. http://www.hpcc.ttu.edu/index.php
31. Keha A.B.; de Farias I.R.; Nemhauser G.L.: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32, 44-48 (2004)
32. Keha A.B.; de Farias I.R.; Nemhauser G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54, 847-858 (2006) (Pubitemid 44546525)
33. Konno H.; Wijayanayake A.: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Program. 89, 233-250 (2001) (Pubitemid 33758941)
34. Markowitz H.M.; Manne A.S.: On the solution of discrete programming problems. Econometrica 25, 84-110 (1957)
35. Martin A.; Möller M.; Moritz S.: Mixed-integer models for the stationary case of gas network optimization. Math. Program. 105, 563-582 (2006) (Pubitemid 41788333)
36. Meyer R.R.: Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16, 191-206 (1975)
37. Meyer R.R.: Mixed- integer minimization models for piecewise-linear functions of a single variable. Discret. Math. 16, 163-171 (1976)
38. Nocedal J.; Wright S.J.: Numerical Optimization. Springer, Berlin (1999)
39. Perold A.F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143-1160 (1984)
40. Sioshansi R.; O'Neill R.O.; Oren S.S.: Economic consequences of alternative solution methods for centralized unit commitment in day-ahead electricity markets. IEEE Trans. Power Syst. 23, 344-352 (2008) (Pubitemid 351695812)
41. Takriti S.; Birge J.R.; Long E.: A stochastic model for the unit commitment problem. IEEE Trans. Power Syst. 11, 1497-1508 (1996) (Pubitemid 126781305)
42. Takriti S.; Krasenbrink B.; Wu L.S.Y.: Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem. Oper. Res. 48, 268-280 (2000)
43. Todd M.J.: On triangulations for computing fixed points. Math. Program. 10, 322-346 (1976)
44. Tomlin J.A.: Special ordered sets and an application to gas supply operations planning. Math. Program. 42, 69-84 (1988)
45. Vielma J.P.; Ahmed S.; Nemhauser G.L.: Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper. Res. 58, 303-315 (2010)
46. Vielma J.P.; Keha A.B.; Nemhauser G.L.: Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5, 467-488 (2008) (Pubitemid 351443135)
47. Vielma J.P.; Nemhauser G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128, 49-72 (2011)
48. Zhang M.; Guan Y.: Two-Stage Robust Unit Commitment Problem. University of Florida, Gainesville (2009)