A combined phase I-phase II projective algorithm for linear programming
For the fractional linear programming problem an algorithm of projective type is devised closely related to Karmarkar's algorithm. The proposed algorithm considers the constraint that an artificial variable be zero at the solution of the original problem explicitly. The inclusion of such a constraint allows to apply the algorithm to standard linear programming problems without any special precautions or conversion to a primal-dual form. The algorithm either detects inconsistency (for example infeasibility) of the problem or generates a sequence of iterations converging to the solution with a corresponding sequence of lower bounds of the optimal value.
- On combined phase 1-phase 2 projective methods for linear programming
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- scientific article; zbMATH DE number 4119925
- Combined projected gradient algorithm for linear programming
- A projective simplex method for linear programming
- scientific article; zbMATH DE number 6613080
- A dual projective simplex method for linear programming
- A dual projective pivot algorithm for linear programming
- scientific article; zbMATH DE number 4185389
- An alternating projections algorithm for solving linear programs
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A relaxed version of Karmarkar's method
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
- An improved general Phase-I method in linear programming
- A combined phase I-phase II scaled potential algorithm for linear programming
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- On interior algorithms for linear programming with no regularity assumptions
- A projective algorithm for linear programming with no regularity condition
- On combined phase 1-phase 2 projective methods for linear programming
- A strictly improving linear programming Phase I algorithm
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
- Potential-reduction methods in mathematical programming
- A dual projective pivot algorithm for linear programming
- A self-adjoint algorithm for solving linear programming problems
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- Linear updates for a single-phase projective method
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- Infeasible interior-point methods for linear optimization based on large neighborhood
- A Fourth bibliography of fractional programming
- scientific article; zbMATH DE number 4119925 (Why is no real title available?)
- Combined projected gradient algorithm for linear programming
- A monotonic projective algorithm for fractional linear programming
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A complete algorithm for linear fractional programs
This page was built for publication: A combined phase I-phase II projective algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114588)
