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ženo v:
| Vydáno v: | Journal of information & optimization sciences Ročník 9; číslo 3; s. 331 - 341 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis Group
01.09.1988
|
| ISSN: | 0252-2667, 2169-0103 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| 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. |
|---|---|
| Bibliografie: | 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 |