Solving Piecewise-Linear Programs: Experiments with a Simplex Approach

DOI10.1287/ijoc.4.1.16zbMath0758.90057OpenAlexW2015292624MaRDI QIDQ3993663

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)

Related Items (5)

A restricted-entry method for a transportation problem with piecewise- linear concave costs ⋮ Optimal objective function approximation for separable convex quadratic programming ⋮ A parametric simplex algorithm for biobjective piecewise linear programming problems ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ Algorithms for network piecewise-linear programs: A comparative study

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