✦ LIBER ✦

On A characterization of optimality in convex programming

✍ Scribed by A. Ben-Israel; A. Ben-Tal

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 340 KB
Volume: 11
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580372

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On optimality in abstract convex program

On optimality in abstract convex programming

✍ L. I. Trudzik 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 730 KB

Characterization of optimality in convex

Characterization of optimality in convex programming without a constraint qualification

✍ A. Ben-Tal; A. Ben-Israel; S. Zlobec 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 822 KB

Primal and dual optimality criteria in c

Primal and dual optimality criteria in convex programming

✍ A. Ben-Tal; A. Charnes 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 434 KB

On a method of unconditional optimizatio

On a method of unconditional optimization in convex programming

✍ Vi.D. Mazurov 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 304 KB

Characterizing an optimal input in pertu

Characterizing an optimal input in perturbed convex programming: Corrigendum

✍ S. Zlobec 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 133 KB

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