A Dual Simplex Algorithm for Piecewise-Linear Programming

DOI10.1057/JORS.1996.63MaRDI QIDQ4717146zbMATH OpenOpenAlexFDO

Authors Francis J. Nourie, Faruk Güder

Publication date 22 June 1997

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1996.63

zbMATH Keywords

piecewise-linear programmingconvex separable piecewise-linear functionsdual piecewise-linear simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A piecewise linear dual phase-1 algorithm for the simplex method
• scientific article; zbMATH DE number 1187125
• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• A dual projective simplex method for linear programming
• A primal-dual simplex method for linear programs
• A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• scientific article; zbMATH DE number 1131737
• A dual version of Tardos's algorithm for linear programming
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications

Cited in

(14)

• scientific article; zbMATH DE number 176425 (Why is no real title available?)
• Efficiency of the dual simplex method for solving systems of linear inequalities
• Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• scientific article; zbMATH DE number 1131737 (Why is no real title available?)
• A sequential dual simplex algorithm for the linear assignment problem
• Relationships among linear formulations of separable convex piecewise linear programs
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Piecewise linear programming via interior points
• A parametric simplex algorithm for biobjective piecewise linear programming problems
• An efficient algorithm for minimizing a multivariate polyhedral function along a line
• A Variant of the Dual Pivoting Rule in Linear Programming

This page was built for publication: A Dual Simplex Algorithm for Piecewise-Linear Programming

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