In optimization theory, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or an infinite number of variables and a finite number of constraints. In the former case the constraints are typically parameterized.[1]
Anderson, Edward J.; Nash, Peter (1987). Linear Programming in Infinite-Dimensional Spaces. Wiley. ISBN0-471-91250-6. OCLC15053031.
Bonnans, J. Frédéric; Shapiro, Alexander (2000). "5.4, 7.4.4 Semi-infinite programming". Perturbation analysis of optimization problems. Springer Series in Operations Research. Springer. pp. 496–526, 581. ISBN978-0-387-98705-7. MR1756264.
Goberna, M.A.; López, M.A. (1998). Linear Semi-Infinite Optimization. Wiley.