Efficiency and generalized convex duality for multiobjective programs

Efficiency and generalized convex duality for multiobjective programs

0.00 Avg rating0 Votes
Article ID: iaor19881232
Country: United States
Volume: 138
Issue: 1
Start Page Number: 84
End Page Number: 94
Publication Date: Feb 1989
Journal: Journal of Mathematical Analysis and Applications
Authors:
Keywords: programming: nonlinear, programming: convex
Abstract:

The concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective non-linear programs. The results are obtained for convex functions, ρ-convex (i.e., weakly convex and strongly convex) functions, and pseudoconvex functions. For the convex and ρ-convex functions a Wolfe type of dual is formulated, while for the pseudoconvex and ρ-convex functions, a Mond-Weir type dual is proposed.

Reviews

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