The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082565038 / 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 variation on Karmarkar’s algorithm for solving linear programming problems / 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: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187574 / 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: Conical projection algorithms for linear programming / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted 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: Q4733658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / 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 17:47, 21 June 2024

scientific article
Language Label Description Also known as
English
The affine-scaling direction for linear programming is a limit of projective-scaling directions
scientific article

    Statements

    The affine-scaling direction for linear programming is a limit of projective-scaling directions (English)
    0 references
    0 references
    1991
    0 references
    The author first presents the affine-scaling algorithm for linear programming. The second algorithm is the projective-scaling algorithm, which is not invariant under the addition of nonnegatively constrained dummy variables. The author shows that the affine-scaling direction for linear programming is a limit of projective-scaling directions. It is an excellent result.
    0 references
    0 references
    Karmarker algorithm
    0 references
    affine-scaling algorithm
    0 references
    linear programming
    0 references
    projective-scaling algorithm
    0 references
    0 references
    0 references