Mond–Weir type duality involving (B, η)-invex functions for a minmax programming problem

Mond–Weir type duality involving (B, η)-invex functions for a minmax programming problem

0.00 Avg rating0 Votes
Article ID: iaor20003019
Country: India
Volume: 21
Issue: 1
Start Page Number: 1
End Page Number: 18
Publication Date: Jan 2000
Journal: Journal of Information & Optimization Sciences
Authors:
Keywords: duality
Abstract:

Several Mond–Weir type duals are proposed for a certain minmax programming problem and the notion of proper (B, η)-invexity is used to establish duality theorems relating the primal and the duals. The duals for a minmax (generalized) fractional programming problem are presented as special cases of the main problem considered in the paper.

Reviews

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