An improved general Phase-I method in linear programming
From MaRDI portal
Publication:1107440
DOI10.1016/0377-2217(88)90011-2zbMATH Open0652.90070OpenAlexW2006102401MaRDI QIDQ1107440FDOQ1107440
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
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
Cited In (10)
- An improved three-step method for solving the interval linear programming problems
- A concise way of determination for LP initial feasible basis of simplex method
- Title not available (Why is that?)
- A strictly improving linear programming Phase I algorithm
- Improvement of FPPR method to solve ECDLP
- A feasible direction method for linear programming
- A general phase-I method in linear programming
- Title not available (Why is that?)
- A phase-1 approach for the generalized simplex algorithm
- A Variant of the Dual Pivoting Rule in 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)
