𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal solution characterization for infinite positive semi-definite programming

✍ Scribed by P. Benson; R.L. Smith; I.E. Schochetman; J.C. Bean

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
226 KB
Volume
7
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This 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