A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
We study a generic minimization problem with separable non-convex 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...
Main Authors: | Croxton, Keely L., Gendon, Bernard, Magnanti, Thomas L. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5233 |
Similar Items
-
Analyzing Multi-Objective Linear and Mixed Integer Programs by Lagrange Multipliers
by: Ramakrishnan, V. S., et al.
Published: (2004) -
New Algorithm to Solve Mixed Integer Quadratically Constrained Quadratic Programming Problems Using Piecewise Linear Approximation
by: Loay Alkhalifa, et al.
Published: (2022-01-01) -
Continuous Piecewise Linear Approximation of Plant-Based Hydro Production Function for Generation Scheduling Problems
by: David Lucas dos Santos Abreu, et al.
Published: (2022-02-01) -
Smoothings of piecewise linear manifolds/
by: 179340 Hirsch, Morris W., et al.
Published: (1974) -
Introduction to piecewise-linear topology/
by: 179522 Rouke, C. P., et al.
Published: (1982)