A numerical approach to infinite-dimensional linear programming in L₁ spaces

DOI10.3934/JIMO.2010.6.15zbMATH Open1206.90081OpenAlexW2056719640MaRDI QIDQ2269742FDOQ2269742

Authors Satoshi Ito, Soon-Yi Wu, Ting-Jang Shiu, Kok Lay Teo

Publication date 11 March 2010

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2010.6.15

zbMATH Keywords

cutting plane methodsemi-infinite programmingnumerical approachinfinite-dimensional linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Semi-infinite programming (90C34)

Recommendations

• Linear programming in measure spaces
• Approximation of Infinite-Dimensional Linear Programming Problems which Arise in Stochastic Control
• scientific article; zbMATH DE number 4029251
• scientific article; zbMATH DE number 3920183
• Extremal points and optimal solutions for general capacity problems

Cited in

(13)

• Solving general capacity problem by relaxed cutting plane approach
• Linear programming in measure spaces
• Numerical representations of a universal subspace flow for linear programs
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• Some remarks on the infinite-dimensional problems of linear programming
• Optimization and approximation for polyhedra in separable Hilbert spaces
• Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
• scientific article; zbMATH DE number 3174750 (Why is no real title available?)
• Solution approach to infinite linear programming problem with capacity constraints
• scientific article; zbMATH DE number 1217739 (Why is no real title available?)
• scientific article; zbMATH DE number 3896702 (Why is no real title available?)
• A linear programming approach to sequential hypothesis testing
• Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty

This page was built for publication: A numerical approach to infinite-dimensional linear programming in \(L_1\) spaces

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