𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Duality in Nondifferentiable Vector Programming

✍ Scribed by R. Osuna-Gómez; A. Rufián-Lizana; P. Ruı́z-Canales

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
108 KB
Volume
259
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. We obtain results which will allow us to characterize the solutions for multiobjective programming problems from the saddle point conditions and allow us to relate them to the dual problem solutions which will be adequately defined. We also define a new dual problem for the multiobjective programming problem with the special property of being a scalar programming problem.

📜 SIMILAR VOLUMES

On Second-Order Symmetric Duality in Non
On Second-Order Symmetric Duality in Nondifferentiable Programming
✍ S.H. Hou; X.M. Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

This article is concerned with a pair of second-order symmetric dual non-differentiable programs and second-order F-pseudo-convexity. We establish the weak and the strong duality theorems for the new pair of dual models under the F-pseudo-convexity assumption. Several known results including Mond an

Optimality and Duality for Complex Nondi
Optimality and Duality for Complex Nondifferentiable Fractional Programming
✍ Jen-Chwan Liu; Chin-Cheng Lin; Ruey-Lin Sheu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one para

Duality for a Class of Nondifferentiable
Duality for a Class of Nondifferentiable Multiobjective Programming Problems
✍ Xin Min Yang; Kok Lay Teo; Xiao Qi Yang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 64 KB

In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established

On Mixed Duality in Mathematical Program
On Mixed Duality in Mathematical Programming
✍ C.R. Bector; Suresh Chandra; Abha 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 87 KB

An incomplete Lagrange function is introduced for a class of nonlinear programming problems which explains the reason behind the construction of the Mond᎐Weir᎐type dual. A mixed-type dual is presented for a class of fractional and generalized fractional programming problems, and various duality theo