A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces
Journal of Global Optimization
A Shadow Simplex Method for Infinite Linear Programs
Operations Research
A “Joint+Marginal” Approach to Parametric Polynomial Optimization
SIAM Journal on Optimization
On the consistency of the mass transfer problem
Operations Research Letters
Control design for specifications on stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Hi-index | 0.00 |
This paper presents approximation schemes for an infinite linear program. In particular, it is shown that, under suitable assumptions, the program's optimum value can be approximated by the values of finite-dimensional linear programs, and that, in addition, every accumulation point of a sequence of optimal solutions for the approximating programs is an optimal solution for the original problem.