A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy

DOI10.1007/BF01580769zbMath0656.90062OpenAlexW2064873618MaRDI QIDQ1110457

Robert Fourer

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

degeneracypiecewise-linear simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)

Related Items (21)

Optimal objective function approximation for separable convex quadratic programming ⋮ A parametric simplex algorithm for biobjective piecewise linear programming problems ⋮ A simplex algorithm for piecewise-linear fractional programming problems ⋮ Discontinuous piecewise linear optimization ⋮ Exact penalty and optimality condition for nonseparable continuous piecewise linear programming ⋮ A simplex algorithm for network flow problems with piecewise linear fractional objective function ⋮ A survey of dynamic network flows ⋮ A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications ⋮ A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ Systematic construction of examples for cycling in the simplex method ⋮ Multiple objective programming with piecewise linear functions ⋮ An algorithm for linearly-constrained piecewise lexicographic programming problems. ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ On a dual method for a specially structured linear programming problem with application to stochastic programming ⋮ Optimal expansion of capacitated transshipment networks ⋮ Algorithms for network piecewise-linear programs: A comparative study ⋮ Piecewise linear programming via interior points ⋮ Vendor selection with price breaks ⋮ Selected bibliography on degeneracy

Cites Work

• A penalty linear programming method using reduced-gradient basis-exchange techniques
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Linear Programming via a Nondifferentiable Penalty Function
• New Finite Pivoting Rules for the Simplex Method
• The Composite Simplex Algorithm
• A complete constructive algorithm for the general mixed linear programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy