A general phase-I method in linear programming

DOI10.1016/0377-2217(86)90215-8zbMath0583.90060OpenAlexW2042342288MaRDI QIDQ1069441

István Maros

Publication date: 1986

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

Full work available at URL: https://research.tue.nl/nl/publications/1eb61f03-1581-4a56-b6bd-4cbcb9c1c030

zbMATH Keywords

simplex methodcomputational experiencesimproved performancePhase I procedures

Mathematics Subject Classification ID

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

Related Items (8)

An improved general Phase-I method in linear programming ⋮ A Variant of the Dual Pivoting Rule in Linear Programming ⋮ A new pivoting rule for solving various degeneracy problems ⋮ On a dual method for a specially structured linear programming problem with application to stochastic programming ⋮ A generalized dual phase-2 simplex algorithm. ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ Advances in design and implementation of optimization software ⋮ MOPS -- Mathematical optimization system

Uses Software

• DEVEX

Cites Work

• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The Composite Simplex Algorithm
• Pivot selection methods of the Devex LP code
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general phase-I method in linear programming