Complexity and computability of solutions to linear programming systems (Q3898028): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: William W. Cooper / rank
Normal rank
 
Property / author
 
Property / author: William W. Cooper / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Page cuts for integer interval linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explicit Solution of a Special Class of Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3294638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal algorithm for interval linear-programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving Interval Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivial integer programs unsolvable by branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimization method for interval linear programming: A new method for linear programming / rank
 
Normal rank

Latest revision as of 10:13, 13 June 2024

scientific article
Language Label Description Also known as
English
Complexity and computability of solutions to linear programming systems
scientific article

    Statements

    Complexity and computability of solutions to linear programming systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    computability
    0 references
    linear programming systems
    0 references
    constraint contraction algorithms
    0 references
    ellipsoidal algorithms
    0 references
    nondifferentiable convex programming
    0 references
    interval programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references