Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints

Mathematical Programming Computation

Volumn 5, Issue 1, 2013, Pages 75-112

  de Farias, I R ^a   Kozyreff, E ^a   Gupta, R ^a   Zhao, M ^b  

^a Texas Tech University   (United States)

^b SAS   (United States)

Author keywords

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

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; PIECEWISE LINEAR TECHNIQUES;

BRANCH-AND-CUT; CONTINUOUS VARIABLES; KNAPSACK PROBLEMS; LINEAR OPTIMIZATION; MIXED-INTEGER PROGRAMMING; PIECEWISE LINEAR; PIECEWISE LINEAR OPTIMIZATION; PIECEWISE-LINEAR; POLYHEDRAL METHOD; SEMI-CONTINUOUS; SEMI-CONTINUOUS VARIABLE; SPECIAL ORDERED SETS;

INTEGER PROGRAMMING;

EID: 84874414781     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-012-0049-9     Document Type: Article

References (32)

1. Beale, E. M. L.: Two transportation problems. In: Kreweras, G., Morlat, G. (eds.) Proceedings of the Third International Conference on Operational Research, Dunod, pp. 780-788 (1963).
2. 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, Tavistock Publications, pp. 447-454 (1970).
3. Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121-140 (1996).
4. Crowder, H., Johnson, E. L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803-834 (1983).
5. Croxton, K. L., Gendron, B., Magnanti, T. L.: Models and methods for merge-in-transit operations. Transp. Sci. 37, 1-22 (2003).
6. 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, Cambridge (2003).
7. Dantzig, G. B.: On the significance of solving linear programming problems with some integer variables. Econometrica 28, 30-44 (1960).
8. 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 (2004).
9. de Farias, I. R. Jr., Johnson, E. L., Nemhauser, G. L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187-203 (2000).
10. de Farias, I. R Jr., Johnson, E. L., Nemhauser, G. L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16, 25-39 (2001).
11. de Farias, I. R. Jr., Kozyreff, E., Gupta, R., Zhao, M.: Branch-and-Cut for Separable Piecewise Linear Optimization and Intersection with Semi-Continuous Constraints. Texas Tech University, USA (2011).
12. de Farias, I. R. Jr., Nemhauser, G. L.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96, 439-467 (2003).
13. de Farias, I. R. Jr., Zhao, M.: A polyhedral study of the semi-continuous knapsack problem. Math. Programm. (2011, submitted).
14. de Farias, I. R. Jr., Zhao, M., Zhao, H.: A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36, 234-238 (2008).
15. Fourer, R., Gay, D. M., Kerninghan, B. W.: AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, USA (1993).
16. Gu, Z.: Personal communication.
17. http://www. hpcc. ttu. edu/index. php.
18. Keha, A. B., de Farias, I. R. Jr., Nemhauser, G. L.: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32, 44-48 (2004).
19. Keha, A. B., de Farias, I. R. Jr., Nemhauser, G. L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54, 847-858 (2006).
20. Konno, H., Wijayanayake, A.: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Program. 89, 233-250 (2001).
21. Markowitz, H. M., Manne, A. S.: On the solution of discrete programming problems. Econometrica 25, 84-110 (1957).
22. Martin, A., Möller, M., Moritz, S.: Mixed-integer models for the stationary case of gas network optimization. Math. Program. 105, 563-582 (2006).
23. Nocedal, J., Wright, S. J.: Numerical Optimization. Springer, Berlin (1999).
24. Perold, A. F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143-1160 (1984).
25. 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).
26. Takriti, S., Birge, J. R., Long, E.: A stochastic model for the unit commitment problem. IEEE Trans. Power Syst. 11, 1497-1508 (1996).
27. 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).
28. Tomlin, J. A.: Special ordered sets and an application to gas supply operations planning. Math. Program. 42, 69-84 (1988).
29. 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).
30. Vielma, J. P., Nemhauser, G. L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128, 49-72 (2011).
31. Zhang, M., Guan, Y.: Two-Stage Robust Unit Commitment Problem. University of Florida, USA (2009).
32. Zhao, M., de Farias, I. R. Jr.: The Piecewise Linear Optimization Polytope: New Inequalities and Intersection with Semi-Continuous Constraints. Math. Program. (2012, in press).