An improved general Phase-I method in linear programming

DOI10.1016/0377-2217(88)90011-2zbMath0652.90070OpenAlexW2006102401MaRDI QIDQ1107440

Katharina Belling-Seib

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90011-2

zbMATH Keywords

basic variablefeasible basic solutionMaros' method

Mathematics Subject Classification ID

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

Related Items (1)

A Variant of the Dual Pivoting Rule in Linear Programming

Cites Work

• Unnamed Item
• A general phase-I method in linear programming
• A duality theorem for non-linear programming
• The Composite Simplex Algorithm

This page was built for publication: An improved general Phase-I method in linear programming