Solution approach to infinite linear programming problem with capacity constraints

DOI10.1007/S10288-011-0155-YzbMATH1258.90093OpenAlexW1969874521MaRDI QIDQ657582FDOQ657582

Authors Qingji Yang

Publication date 10 January 2012

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-011-0155-y

zbMATH Keywords

capacity constraintmulticlassinfinite linear programming problemtoll

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Semi-infinite programming (90C34)

Recommendations

• A numerical approach to infinite-dimensional linear programming in \(L_1\) spaces
• Extremal points and optimal solutions for general capacity problems
• Solving general capacity problem by relaxed cutting plane approach
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• scientific article; zbMATH DE number 3965817

Cites work

• scientific article; zbMATH DE number 1059230 (Why is no real title available?)
• Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
• Cost versus time equilibrium over a network
• Existence and computation of optimal tolls in multiclass network equilibrium problems
• Network-Optimized Road Pricing: Part I: A Parable and a Model
• Network-Optimized Road Pricing: Part II: Algorithms and Examples
• Remarks on general infinite dimensional duality with cone and equality constraints
• Time-dependent traffic equilibria

This page was built for publication: Solution approach to infinite linear programming problem with capacity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657582)