Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem: Journal of Information and Optimization Sciences: Vol 21, No 1

Views

CrossRef citations to date

Altmetric

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

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

Information for

Open access

Opportunities

Help and information

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

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature