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

We study a generic minimization problem with separable nonconvex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Management science Jg. 49; H. 9; S. 1268 - 1273
Hauptverfasser:	Croxton, Keely L, Gendron, Bernard, Magnanti, Thomas L
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum INFORMS 01.09.2003 Institute for Operations Research and the Management Sciences
Schriftenreihe:	Management Science
Schlagworte:	Algorithms Business studies Cost analysis Cost functions Costs Discourse functions Economics Integer Programming Lagrangian function Lagrangian Relaxation Linear programming Linear Relaxation Management Management science Minimization Minimization of cost Objective functions Operations research Optimal solutions Piecewise Linear Polyhedrons Production planning Relaxation Studies Technology Telecommunications Textbooks Transport Variable costs Variables
ISSN:	0025-1909, 1526-5501
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!