Piecewise-linear programming: The compact (CPLP) algorithm
From MaRDI portal
Publication:3754440
DOI10.1007/BF02592026zbMath0617.90070MaRDI QIDQ3754440
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
degeneracysimplex methodlinear constraintsline searchcompact algorithmconvex piecewise-linear programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)
Related Items (8)
A simplex algorithm for piecewise-linear programming I: Derivation and proof ⋮ A simplex algorithm for piecewise-linear fractional programming problems ⋮ Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator ⋮ A survey of dynamic network flows ⋮ An algorithm for linearly-constrained piecewise lexicographic programming problems. ⋮ Computation of the optimal value function in time-dependent networks ⋮ The empirical performance of a polynomial algorithm for constrained nonlinear optimization ⋮ Piecewise lexicographic programming: A new model for practical decision problems
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
This page was built for publication: Piecewise-linear programming: The compact (CPLP) algorithm
