A duality model for a generalized minmax program

Meena K. Bector, I. Husain, S. Chandra and C. R. Bector

Naval Research Logistics (NRL), 1988, vol. 35, issue 5, 493-501

Abstract: We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved.

Date: 1988
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198810)35:53.0.CO;2-R

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:35:y:1988:i:5:p:493-501

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().