Solving Piecewise-Linear Programs: Experiments with a Simplex Approach

DOI10.1287/IJOC.4.1.16MaRDI QIDQ3993663zbMATH OpenOpenAlexFDO

Authors Robert Fourer, Roy E. Marsten

Publication date 13 August 1992

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f791f8ad6df6f913a108076b43964004b46bcd2d

zbMATH Keywords

piecewise-linear simplex implementation

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Piecewise-linear programming: The compact (CPLP) algorithm
• scientific article; zbMATH DE number 1195629
• Algorithms for network piecewise-linear programs: A comparative study

Cited in

(15)

• scientific article; zbMATH DE number 176425 (Why is no real title available?)
• A restricted-entry method for a transportation problem with piecewise- linear concave costs
• scientific article; zbMATH DE number 1131737 (Why is no real title available?)
• Finding all solutions of separable systems of piecewise-linear equations using integer programming
• Algorithms for network piecewise-linear programs: A comparative study
• Some questions of piecewise linear programming
• The hill detouring method for minimizing hinging hyperplanes functions
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A parametric simplex algorithm for biobjective piecewise linear programming problems
• Piecewise linear valued constraint satisfaction problems with fixed number of variables
• Finding normal solutions in piecewise linear programming
• Optimal objective function approximation for separable convex quadratic programming
• A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
• Piecewise-linear programming: The compact (CPLP) algorithm

This page was built for publication: Solving Piecewise-Linear Programs: Experiments with a Simplex Approach

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