On combined phase 1-phase 2 projective methods for linear programming (Q1207329): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined phase I-phase II projective algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Search Directions for Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear updates for a single-phase projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search directions for interior linear-programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Anstreicher's combined phase I-phase II projective algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank

Latest revision as of 14:40, 17 May 2024

scientific article
Language Label Description Also known as
English
On combined phase 1-phase 2 projective methods for linear programming
scientific article

    Statements

    On combined phase 1-phase 2 projective methods for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    The authors compare several projective algorithms for solving linear programming problems. These algorithms have the feature that they approach feasibility and optimality simultaneously. The directions used in these methods are compared.
    0 references
    interior-point methods
    0 references
    projective algorithms
    0 references
    0 references
    0 references

    Identifiers