A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Max-Flow Min-Cut theorem for countable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumventing the Slater conundrum in countably infinite linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Countably Infinite Monotropic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shadow Simplex Method for Infinite Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing extreme points as basic feasible solutions in infinite linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex Algorithm for Countable-State Discounted Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of purely finitely additive multipliers in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Duality Theory for Separated Continuous Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing and covering polyhedra in infinite dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme point characterizations for infinite network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadow Prices in Infinite-Dimensional Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in infinite dimensional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite dimensional approximation in infinite dimensional mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm for minimum-cost network-flow problems in infinite networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank

Revision as of 03:30, 16 July 2024

scientific article
Language Label Description Also known as
English
A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
scientific article

    Statements

    A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (English)
    0 references
    0 references
    0 references
    18 July 2018
    0 references
    network simplex method
    0 references
    infinite networks
    0 references
    duality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references