Duality in Countably Infinite Monotropic Programs
From MaRDI portal
Recommendations
- Duality for extended infinite monotropic optimization problems
- Strong duality for generalized monotropic programming in infinite dimensions
- Duality in infinite dimensional linear programming
- scientific article; zbMATH DE number 5781369
- Extended monotropic programming and duality
- scientific article; zbMATH DE number 4114367
- Duality theorems of a nonconvex program with infinite constraints
- Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
- Duality for semi-definite and semi-infinite programming
- Duality and infinite dimensional optimization
Cites work
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- A shadow simplex method for infinite linear programs
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Approaches to the theory of optimization
- Approximation Schemes for Infinite Linear Programs
- Circumventing the Slater conundrum in countably infinite linear programs
- Convex Analysis
- Convex programming and systems of elementary monotonic relations
- Duality in infinite dimensional linear programming
- Extended monotropic programming and duality
- Extreme point characterizations for infinite network flow problems
- Finite dimensional approximation in infinite dimensional mathematical programming
- scientific article; zbMATH DE number 3853853 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3484308 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- scientific article; zbMATH DE number 1888460 (Why is no real title available?)
- scientific article; zbMATH DE number 3255437 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Infinite dimensional analysis. A hitchhiker's guide
- Infinite Horizon Optimization
- Monotone networks
- Shadow prices in infinite-dimensional linear programming
- Simplex algorithm for countable-state discounted Markov decision processes
- Strong duality for generalized monotropic programming in infinite dimensions
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
Cited in
(9)- Strong duality for generalized monotropic programming in infinite dimensions
- Duality for extended infinite monotropic optimization problems
- A simplex method for uncapacitated pure-supply infinite network flow problems
- Circumventing the Slater conundrum in countably infinite linear programs
- A simplex method for countably infinite linear programs
- Duality for optimization problems with infinite sums
- Duality in Markov Decision Problems with Countable Action and State Spaces
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- Minimum spanning trees in infinite graphs: theory and algorithms
This page was built for publication: Duality in Countably Infinite Monotropic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359500)