Duality for minimax programming involving \(V\)-invex functions. (English) Zbl 0816.49028

Summary: Sufficient optimality conditions and duality results for a class of minmax programming problems are obtained under \(V\)-invexity type assumptions on objective and constraint functions. Applications of these results to certain fractional and generalized fractional programming problems are also presented.


49N15 Duality theory (optimization)
49K35 Optimality conditions for minimax problems
90C32 Fractional programming
Full Text: DOI


[1] DOI: 10.1007/BF00940006 · Zbl 0632.90077
[2] Bector C.R., Asia-Pacific J. ofOper. Res 5 pp 134– (1988)
[3] DOI: 10.1017/S0334270000005282 · Zbl 0616.90079
[4] DOI: 10.1007/BF02591908 · Zbl 0526.90083
[5] Hanson M.A., J. of Math. Analy. Appl 80 pp 544– (1981) · Zbl 0463.90080
[6] DOI: 10.1007/BF00935361 · Zbl 0502.90079
[7] DOI: 10.1017/S0334270000007372 · Zbl 0773.90061
[8] Mangasarian O.L., Nonlinear Programming (1969)
[9] Mond B., Generalized Concavity in Optimization and Economics
[10] Mond B., J. of Inform. Opt. Sc 3 pp 105– (1982)
[11] DOI: 10.1007/BF00939335 · Zbl 0619.90075
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.