A general phase-I method in linear programming

DOI10.1016/0377-2217(86)90215-8zbMATH Open0583.90060OpenAlexW2042342288MaRDI QIDQ1069441FDOQ1069441

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)

Cites Work

• Pivot selection methods of the Devex LP code
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The Composite Simplex Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

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

Uses Software

• DEVEX

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

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