✦ LIBER ✦

Dual conditions characterizing optimality for convex multi-objective programs

✍ Scribed by B.M. Glover; V. Jeyakumar; A.M. Rubinov

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 144 KB
Volume: 84
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107980013a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimality conditions for directionally

Optimality conditions for directionally differentiable multi-objective programming problems

✍ Y. Ishizuka 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 865 KB

An approximation algorithm for convex mu

An approximation algorithm for convex multi-objective programming problems

✍ Matthias Ehrgott; Lizhen Shao; Anita Schöbel 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 580 KB

A note on multiple optimality conditions

A note on multiple optimality conditions for programs with convex inequality constraints

✍ Godfrey Muganda 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Optimal objective function approximation

Optimal objective function approximation for separable convex quadratic programming

✍ F. Güder; J. G. Morris 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 513 KB

An optimality condition for a nondiffere

An optimality condition for a nondifferentiable convex program

✍ Henry Wolkowicz 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 155 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