Relationships among linear formulations of separable convex piecewise linear programs

DOI10.1007/BFB0121047zbMATH Open0581.90070OpenAlexW991844967MaRDI QIDQ3703597FDOQ3703597

Authors: James K. Ho 

Publication date: 1985

Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121047

Recommendations

• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Polyhedral methods for piecewise-linear functions. I: The lambda method
• Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
• A Dual Simplex Algorithm for Piecewise-Linear Programming
• scientific article; zbMATH DE number 3916036

zbMATH Keywords

linearizationdecomposition principleseparable convex piecewise-linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (6)

• Algorithms for network piecewise-linear programs: A comparative study
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Polyhedral methods for piecewise-linear functions. I: The lambda method
• Vendor selection with price breaks
• Piecewise lexicographic programming: A new model for practical decision problems
• Piecewise-linear programming: The compact (CPLP) algorithm

This page was built for publication: Relationships among linear formulations of separable convex piecewise linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703597)