Duality for a Class of Nondifferentiable Multiple Objective Programming Problems

Mond-Weir and Wolfe type duals for a nondifferentiable multiple objective programming problem are formulated, and weak and strong duality theorems relating properly efficient solutions of the primal and dual problems are proved.

Uložené v:
Podrobná bibliografia
Vydané v:Journal of information & optimization sciences Ročník 9; číslo 3; s. 331 - 341
Hlavní autori: Mond, B., Husain, I., Durga Prasad, M.V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Taylor & Francis Group 01.09.1988
ISSN:0252-2667, 2169-0103
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Mond-Weir and Wolfe type duals for a nondifferentiable multiple objective programming problem are formulated, and weak and strong duality theorems relating properly efficient solutions of the primal and dual problems are proved.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0252-2667
2169-0103
DOI:10.1080/02522667.1988.10698934