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
Recommendations
cutting plane methodsemi-infinite programmingnumerical approachinfinite-dimensional linear programming
Numerical mathematical programming methods (65K05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Semi-infinite programming (90C34)
Cited In (13)
- Title not available (Why is that?)
- Some remarks on the infinite-dimensional problems of linear programming
- Title not available (Why is that?)
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Optimization and approximation for polyhedra in separable Hilbert spaces
- Solving general capacity problem by relaxed cutting plane approach
- Linear programming in measure spaces
- Numerical representations of a universal subspace flow for linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach
- Solution approach to infinite linear programming problem with capacity constraints
- A linear programming approach to sequential hypothesis testing
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)
