An improved general Phase-I method in linear programming

DOI10.1016/0377-2217(88)90011-2MaRDI QIDQ1107440zbMATH OpenOpenAlexFDO

Authors 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)

Review text

Problems of finding a feasible basic solution in linear programming are studied. The feasible range of the problem is determined by the conditions: \(Ax=b\), \(bu_ i\leq x_ i\leq b\ell_ i\) \((i=1,...,n)\), where A is an (m,n)-matrix with rank m; x and b are corresponding vectors. Various schemes and algorithms based on the Maros' method are suggested. It is shown theoretically and computationally that the efficiency of these schemes can be significant.

Recommendations

• A general phase-I method in linear programming
• A strictly improving linear programming Phase I algorithm
• An improved algorithm of simplex method in linear programming problem
• An improving procedure of the interior projective method for linear programming
• A phase-1 approach for the generalized simplex algorithm
• An Improved Successive Linear Programming Algorithm
• A new linearization method for generalized linear multiplicative programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• scientific article; zbMATH DE number 883355

Cites work

• A duality theorem for non-linear programming
• A general phase-I method in linear programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• The Composite Simplex Algorithm

Cited in

(10)

• A general phase-I method in linear programming
• A strictly improving linear programming Phase I algorithm
• A phase-1 approach for the generalized simplex algorithm
• A concise way of determination for LP initial feasible basis of simplex method
• A Variant of the Dual Pivoting Rule in Linear Programming
• scientific article; zbMATH DE number 1558120 (Why is no real title available?)
• An improved three-step method for solving the interval linear programming problems
• scientific article; zbMATH DE number 2187395 (Why is no real title available?)
• Improvement of FPPR method to solve ECDLP
• A feasible direction method for linear programming

This page was built for publication: An improved 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 Q1107440)