A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science

Volumn 49, Issue 9, 2003, Pages 1268-1273

  Croxton, Keely L ^a   Gendron, Bernard ^b   Magnanti, Thomas L ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c Department of Civil and Environmental Engineering   (United States)

Author keywords

Integer Programming; Lagrangian Relaxation; Linear Relaxation; Piecewise Linear

Indexed keywords

APPROXIMATION THEORY; COSTS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; RELAXATION PROCESSES;

COST FUNCTIONS;

MANAGEMENT SCIENCE;

EID: 0142095169     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.49.9.1268.16570     Document Type: Article

References (22)

1. Aghezzaf E. H., L. A. Wolsey. 1994. Modeling piecewise linear concave costs in a tree partitioning problem. Discrete Appl. Math. 50 101-109.
2. Balakrishnan, A., S. Graves. 1989. A composite algorithm for a concave-cost network flow problem. Networks 19 175-202.
3. Bienstock, D., O. Günlük. 1996. Capacitated network design-polyhedral structure and computation. INFORMS J. Comput. 8 243-259.
4. Chan, L., A. Muriel, D. Simchi-Levi. 1997. Supply chain management: Integrating inventory and transportation. Working paper, Northwestern University, Evanston, IL.
5. Cominetti, R., F. Ortega. 1997. A branch & bound method for minimum concave cost network flows based on sensitivity analysis. Working paper, Universidad de Chile, Santiago, Chile.
6. Croxton, K. L. 1999. Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management. Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
7. _, B. Gendron, T. L. Magnanti. 2002a. Models and methods for merge-in-transit operations. Transportation Sci. 37 1-22.
8. _, _, _. 2002b. Variable disaggregation in network flow problems with piecewise linear costs. Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
9. _, _, _. 2002c. A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
10. Dantzig, G. B. 1960. On the significance of solving linear programming problems with some integer variables. Econometrica 28 30-44.
11. _. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
12. Falk, J. E. 1969. Lagrange multipliers and nonconvex programs. SIAM J. Control 7 534-545.
13. _, R. M. Soland. 1969. An algorithm for separable nonconvex programming problems. Management Sci. 15 550-569.
14. Gabrel, V., A. Knippel, M. Minoux. 1999. Exact solution of multi-commodity network optimization problems with general step cost functions. Oper. Res. Lett. 25 15-23.
15. Geoffrion, A. M. 1974. Lagrangean relaxation for integer programming. Math. Programming Stud. 2 82-114.
16. Günlük, O. 1999. A branch-and-cut algorithm for capacitated network design problems. Math. Programming A86 17-39.
17. Hadley, G. 1964. Non-Linear and Dynamic Programming. Addison-Wesley, New York.
18. Holmberg, K. 1994. Solving the staircase cost facility location problem with decomposition and piecewise linearization. Eur. J. Oper. Res. 75 41-61.
19. _, J. Ling. 1997. A Lagrangan heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. 97 63-74.
20. Magnanti, T. L., P. Mirchandani, R. Vachani. 1995. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43 142-157.
21. Manne, A. S., H. M. Markowitz. 1957. On the solution of discrete programming problems. Econometrica 25 84-110.
22. Vajda, S. 1964. Mathematical Programming. Addison-Wesley, New York.