Optimality and duality for a class of nondifferentiable minimax fractional programming problems
DOI:
https://doi.org/10.2298/YJOR0901049BKeywords:
Fractional programming, generalized invexity, optimality conditions, dualityAbstract
Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we prove some duality results.References
Bector, C.R., and Bhatia, B.L., “Sufficient optimality conditions and duality for a minmax problem”, Utilitas Math., 27 (1985) 229-247.
Chandra, S., and Kumar, V., “Duality in fractional minimax programming”, J. Austral. Math. Soc. Ser. A, 58 (1995) 376-386.
Lai, H.C., Liu, J.C., and Tanaka, K., “Necessary and sufficient conditions for minimax fractional programming”, J. Math. Anal. Appl., 230 (1999) 311-328.
Liu, J.C., “Optimality and duality for generalized fractional programming involving nonsmooth ( , ) F ρ -convex functions”, Comput. Math. Appl., 32 (1996) 91-102.
Liu, J.C., and Wu, C.S., “On minimax fractional optimality conditions with ( , ) F ρ convexity”, J. Math. Anal. Appl., 219 (1998) 36-51.
Schmittendorf, W.E., “Necessary conditions and sufficient conditions for static minmax problems”, J. Math. Anal. Appl., 57 (1977) 683-693.
Singh, C., “Optimality conditions for fractional minimax programming”, J. Math. Anal. Appl., 100 (1984) 409-415.
Sinha, S.M., “A extension of a theorem of supports of a convex function”, Management Sci., 16 (1966) 409-415.
Yadev, S.R., and Mukherjee, R.N., “Duality for fractional minimax programming problems”, J. Austral. Math. Soc. Ser. B, 31 (1990) 484-492.
Downloads
Published
Issue
Section
License
Copyright (c) 2009 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.