✦ LIBER ✦

On optimality in abstract convex programming

✍ Scribed by L. I. Trudzik

Publisher: Springer
Year: 1983
Tongue: English
Weight: 730 KB
Volume: 27
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01916896

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On interior and convexity conditions, de

On interior and convexity conditions, development of dual problems and saddlepoint optimality criteria in abstract mathematical programming

✍ David A. Pyne 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 363 KB

On A characterization of optimality in c

On A characterization of optimality in convex programming

✍ A. Ben-Israel; A. Ben-Tal 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 340 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

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

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

Convex programming for disjunctive conve

Convex programming for disjunctive convex optimization

✍ Sebastián Ceria; João Soares 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 148 KB