A new efficient primal dual simplex algorithm (Q1868820): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average number of pivot steps required by the Simplex-Method is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple centrality corrections in a primal-dual method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting dense columns of constraint matrix in interior point methods for large scale linear programming<sup>1</sup><sup>1</sup>The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:<sup>2</sup><sup>2</sup>A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-… / 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: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible (exterior point) simplex algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exterior point simplex algorithm for (general) linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient simplex type algorithm for sparse and dense linear programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monotonic Build-Up Simplex Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with a new primal and dual pivot rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual simplex method for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible direction method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Interior-Point and Pivoting Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Primal- and Dual-Optimal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of the problem of degeneracy in a primal and dual simplex algorithm / rank
 
Normal rank

Latest revision as of 15:29, 5 June 2024

scientific article
Language Label Description Also known as
English
A new efficient primal dual simplex algorithm
scientific article

    Statements

    A new efficient primal dual simplex algorithm (English)
    0 references
    0 references
    0 references
    28 April 2003
    0 references
    0 references
    Linear programming
    0 references
    Exterior point algorithm
    0 references
    Numerical results
    0 references
    Two-path
    0 references
    algorithms
    0 references