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.
Saved in:
| Published in: | Journal of information & optimization sciences Vol. 9; no. 3; pp. 331 - 341 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Taylor & Francis Group
01.09.1988
|
| ISSN: | 0252-2667, 2169-0103 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | 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 |