Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / 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: 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: A multiplicative barrier function method 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, based on Newton's 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: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank

Latest revision as of 16:32, 18 June 2024

scientific article
Language Label Description Also known as
English
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
scientific article

    Statements

    Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    Karmarkar's algorithm
    0 references
    duality
    0 references
    cutting objective
    0 references
    polynomial-time complexity
    0 references