Piecewise-linear programming: The compact (CPLP) algorithm

DOI10.1007/BF02592026zbMath0617.90070MaRDI QIDQ3754440

Amedeo Premoli

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

degeneracy; simplex method; linear constraints; line search; compact algorithm; convex piecewise-linear programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C05: Linear programming

Related Items

An algorithm for linearly-constrained piecewise lexicographic programming problems., A simplex algorithm for piecewise-linear fractional programming problems, A survey of dynamic network flows, The empirical performance of a polynomial algorithm for constrained nonlinear optimization, Piecewise lexicographic programming: A new model for practical decision problems, A simplex algorithm for piecewise-linear programming I: Derivation and proof

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear Programming with Special Ordered Sets
• Relationships among linear formulations of separable convex piecewise linear programs
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• An Efficient Method for the Discrete Linear L 1 Approximation Problem
• Linear Programming via a Nondifferentiable Penalty Function
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• Solving staircase linear programs by the simplex method, 2: Pricing
• The Composite Simplex Algorithm
• Discrete approximation in the L1 norm
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation