Sufficiency and duality in nondifferentiable multiobjective programming

Sufficiency and duality in nondifferentiable multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor19912110
Country: India
Volume: 28
Issue: 2
Start Page Number: 73
End Page Number: 87
Publication Date: Jun 1991
Journal: OPSEARCH
Authors: ,
Keywords: programming: nonlinear, programming: mathematical
Abstract:

A nondifferentiable multiobjective programming problem is considered and Fritz John and Kuhn-Tucker type sufficient conditions are derived for efficient and properly efficient solutions respectively. Weak and strong duality theorems are established for Wolfe type dual. Also, a converse duality theorem is proved for a special class of nondifferentiable program where subgradients can be computed explicitly.

Reviews

Required fields are marked *. Your email address will not be published.