On nondifferentiable minimax semi-infinite programming problems in complex spaces

References

[1] Ahmad I., Second order nondifferentiable minimax fractional programming with square root terms, Filomat 27 (2013), no. 1, 135–142. 10.2298/FIL1301135ASuche in Google Scholar

[2] Ahmad I., Husain Z. and Sharma S., Second-order duality in nondifferentiable minmax programming involving type-I functions, J. Comput. Appl. Math. 215 (2008), no. 1, 91–102. 10.1016/j.cam.2007.03.022Suche in Google Scholar

[3] Ahmad I., Husain Z. and Sharma S., Higher-order duality in nondifferentiable minimax programming with generalized type I functions, J. Optim. Theory Appl. 141 (2009), no. 1, 1–12. 10.1007/s10957-008-9474-3Suche in Google Scholar

[4] Charnes A., Cooper W. W. and Kortanek K., A duality theory for convex programs with convex constraints, Bull. Amer. Math. Soc. 68 (1962), 605–608. 10.1090/S0002-9904-1962-10870-2Suche in Google Scholar

[5] Datta N. and Bhatia D., Duality for a class of nondifferentiable mathematical programming problems in complex space, J. Math. Anal. Appl. 101 (1984), no. 1, 1–11. 10.1016/0022-247X(84)90053-2Suche in Google Scholar

[6] Gupta S. K., Dangar D. and Kumar S., Second-order duality for a nondifferentiable minimax fractional programming under generalized α-univexity, J. Inequal. Appl. 2012 (2012), Article ID 187. 10.1186/1029-242X-2012-187Suche in Google Scholar

[7] Jayswal A., Kumar R. and Kumar D., Minimax fractional programming problem involving nonsmooth generalized α-univex functions, Int. J. Optim. Control. Theory Appl. (IJOCTA) 3 (2013), no. 1, 7–22. 10.11121/ijocta.01.2013.00102Suche in Google Scholar

[8] Jayswal A., Prasad A. K., Ahmad I. and Agarwal R. P., Duality for semi-infinite programming problems involving (Hp,r)-invex functions, J. Inequal. Appl. 2013 (2013), Article ID 200. 10.1186/1029-242X-2013-200Suche in Google Scholar

[9] Lai H. C. and Huang T. Y., Optimality conditions for a nondifferentiable minimax programming in complex spaces, Nonlinear Anal. 71 (2009), no. 3–4, 1205–1212. 10.1016/j.na.2008.11.053Suche in Google Scholar

[10] Levinson N., Linear programming in complex space, J. Math. Anal. Appl. 14 (1966), 44–62. 10.1007/978-1-4612-5335-8_48Suche in Google Scholar

[11] Mond B., An extension of the transposition theorems of Farkas and Eisenberg, J. Math. Anal. Appl. 32 (1970), 559–566. 10.1016/0022-247X(70)90277-5Suche in Google Scholar

[12] Mond B. and Craven B. D., A class of nondifferentiable complex programming problems, Math. Operationsforsch. Statist. 6 (1975), no. 4, 581–591. 10.1080/02331887508801238Suche in Google Scholar

[13] Smart I. and Mond B., Complex nonlinear programming: Duality with invexity and equivalent real programs, J. Optim. Theory Appl. 69 (1991), no. 3, 469–488. 10.1007/BF00940685Suche in Google Scholar

[14] Stancu-Minasian I. M., Fractional Programming. Theory, Methods and Applications, Math. Appl. 409, Kluwer, Dordrecht, 1997. 10.1007/978-94-009-0035-6Suche in Google Scholar

[15] Stefanescu M. V. and Stefanescu A., On semi-infinite minmax programming with generalized invexity, Optimization 61 (2012), no. 11, 1307–1319. 10.1080/02331934.2011.563304Suche in Google Scholar

[16] Verma R. U., The (G;β;ϕ;h⁢(⋅,⋅);ρ;θ)-univexities of higher-orders with applications to parametric duality models in minimax fractional programming, Theory Appl. Math. Comput. Sci. 3 (2013), no. 1, 65–84. Suche in Google Scholar

[17] Zalmai G. J., Generalized (α,β,γ,η,ρ,θ)-invex functions in semi-infinite fractional programming. Part I: Sufficient optimality conditions, Rev. Roumaine Math. Pures Appl. 58 (2013), no. 1, 9–34. Suche in Google Scholar