Stability theorems for infinitely constrained mathematical programs
From MaRDI portal
Publication:1211417
DOI10.1007/BF00933851zbMath0291.90062OpenAlexW2043962752MaRDI QIDQ1211417
W. P. Pierskalla, Harvey J. Greenberg
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933851
Related Items
A strong duality theorem for the minimum of a family of convex programs ⋮ Generic primal-dual solvability in continuous linear semi-infinite programming ⋮ On the stability of Voronoi cells ⋮ Unnamed Item ⋮ On the stability of the Motzkin representation of closed convex sets ⋮ On upper semicontinuity of global minima in constrained optimization problems ⋮ Primal-dual stability in continuous linear optimization ⋮ Stability and Continuity in Robust Optimization ⋮ Stability in disjunctive linear optimization I: continuity of the feasible set ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the continuity of the minimum set of a continuous function
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Pseudo-Concave Programming and Lagrange Regularity
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- The Validity of a Family of Optimization Methods
- Non-Chebyshevian Moment Problems
- On the Computational Solution of a Class of Generalized Moment Problems
- A Review of Quasi-Convex Functions
- Stability in Nonlinear Programming
- Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
- Control and Estimation of Computational Errors in the Evaluation of Interpolation Formulae and Quadrature Rules