One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Published in last 50 years
The perturbational Lagrangian equation established by Jeroslow in convex semi-infinite programming is derived from Helly's theorem and some prior results on one-dimensional perturbations of convex programs.
AbstractThis paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories, which give only necessary or sufficient conditions for optimality, but not both.