|
[1] T. Antczak, Multiobjective Programming under d-invexity, European Journal of Operational Research, 137 (2002), 28-36. [2] T. Antczak, The Notion of V-r-Invexity in Differentiable Multiobjective Programming, J. Appl. Anal., 11 (2005), 63-79. [3] D. Bhatia and S. Pandey, A Note on Multiobjective Fractional Programming, Cahiers du Cero, 33 (1991), 3-11. [4] D. Bhatia, and P. K. Garg, Duality for Nonsmooth Nonlinear Fractional Multiobjective Programs Via (F, )-Convexity, Optimization, 43 (1998), 185-197. [5] N. Datta, Efficiency in Multi-Objective Fractional Programming, J. Inform. Optim. Sci. 3 (1982), 262-268. [6] A. M. Geoffrion, Proper Efficiency and Theory of Vector Maximization, J. Math. Anal. Appl. 22 (1968), 618-630. [7] M. A. Hanson, On Sufficiency of the Kuhn-Tucker Conditions, J. Math. Anal. Appl. 80 (1981), 545-550. [8] R.N. Kaul and V. Lyall, A Note on Nonlinear Fractional Vector Maximization, Opsearch, 26 (1989), 108-121. [9] Z. A. Khan and M. A. Hanson, On Ratio Invexity in Mathematical Programming, J. Math. Anal. Appl. 205 (1997), 330-336. [10] J.C.Liu, Optimality and Duality for Multiobjectional Programming Involving Nonsmooth Pseudoinvex Functions, Optimization. 37 (1996), 27-39. [11] R. N. Mukherjee, Generalized Convex Duality for Multiobjective Fractional Programs, J. Math. Anal. Appl. 162 (1991), 309-316.
[12] C. Singh, and M.A, Hanson, Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming, J. Inform. Optim. Sci. 7 (1986), 41-48. [13] C. Singh, Optimality Conditions in Multiobjective Differentiable Programming, J. Optim. Theory Appl. 53 (1987), 115-123. [14] C. Singh, and M.A, Hanson, Generalized Proper Efficiency in Multiobjective Programming, J. Inform. Optim. Sci. 12 (1991), 139-144. [15] C.Singh, S.K. Suneja, and N.G. Rueda, Preinvexity in Multiobjective Fractional Programming, J. Inform. Optim. Sci. 13 (1992), 293-302. [16] S. K. Suneja and S. Gupta, Duality in Multiple Objective Fractional Programming Problems Involving Non-convex Functions, Opsearch, 27 (1990), 239-253. [17] S. K. Suneja and M. K. Srivastava, Duality in Multiobjective Fractional Programming Involving Generalized Invexity, Operational Research Society of India. 31 (1994), 127-143. [18] S.K. Suneja, and C.S. Lalitha, Multiobjective Fractional Programming Involving -Invex and Related Functions, Opsearch, 30 (1993), 1-14. [19] T. Weir, A Duality for a Multiple Objective Fractional Programming Problem, J. Inform. Optim. Sci. 7 (1986), 261-269. [20] T. Weir, A Note on Invex Functions and Multiple Objective Optimization, Opsearch, 25 (1988), 98-104. [21] T. Weir, Duality for Nondifferentiable Multiple Objective Fractional Programming Problems, Utilitas Math. 36 (1989), 53-64.
[1] R. R. Abrams and A. Ben-Israel, ”Nonlinear programming in complex space: necessary conditions”, SIAM. J. Control. 9 (1971), 606-620. [2] R. A. Abrams, ”Nonlinear programming in complex space: sufficient conditions and duality”, J. Math. Anal. Appl. 38 (1972), 619-632. [3] D. Bhatia and R. N. Kaul, ”Nonlinear programming in complex space”, J. Math. Anal. Appl. 28 (1969), 144-152. [4] J.-C. Chen and H.-C. Lai, ”Optimality conditions for minimax programming of anlaytic functions”, Taiwanese J. Math. 8(4) (2004), 673-686. [5] J.-C. Chen, H.-C. Lai and S. Schaible, ”Complex fractional programming and the Charnes- Cooper transformation”, J. Optim. Theory Appl. 126(1), (2005), 203-213. [6] B. D. Craven and B. Mond, ”On duality in complex linear programming”, J. Austral. Math. Soc. 16 (1973), 172-175. [7] C. Das and K. Swarup, ”Nonlinear complex programming with nonlinear constraints”, Z.Angew. Math. Mech. 57 (1977),333-338. [8] N. Datta and D. Bhatia, ”Duality for a class of nondifferentiable mathematical programming problems in complex space”, J. Math. Anal. Appl. 101 (1984), 1-11. [9] O. Ferrero, ”On nonlinear programming in complex space”, J. Math. Anal. Appl. 164 (1992), 399-416. [10] T. R. Gulati, ”On nonliear nondifferentiable complex programming”, Z.Angew. Math. Mech. 62 (1982), 418-420. [11] M. A. Hanson and B. Mond, ”Duality for nonlinear programming in complex space”, J. Math. Anal. Appl. 28 (1969), 52-58. [12] O. P. Jain and P. C. Saxena, ”A duality theorem for a special class of programming problems in complex space”, J. Optim. Theory Appl. 16 (1975), 207-220. [13] H.-C. Lai, J.-C. Lee and J.-C. Liu, ”Duality for fractional complex programming with generalized convexity”, J. Nonlinear and Convex Analysis 2 (2001), 175-191. [14] H.-C. Lai, J.-C. Liu, and K. Tanaka, ”Necessary and sufficient conditions for minimax fractional programming”,J. Math. Anal. Appl. 230 (1999), 311-328. [15] H.-C. Lai and J.-C. Liu, ”Nondifferentiable fractional programming in complex spaces involving (ℑ, , )-convex analytic functions”, Indian J. Pure Appl. Math. 33 (6) (2002), 917-932. [16] H.-C. Lai and J.-C. Liu, ”Complex fractional programming involving generalized quasi/pseudo convex functions”, Z. Angew. Math Mech. 82 (2002) 3, 159-166. [17] H.-C. Lai and J.-C. Liu, ”Optimality conditions for multiobjective programming with generalized (ℑ, , )-convex set functions”, J. Math. Anal. Appl., 215 (1997), 443-460.
[18] N. Levinson, ”Linear programming in complex space”, J. Math. Anal. Appl. 14 (1966), 44-62. [19] J.-C. Liu, C.-C. Lin, and R.-L. Sheu, ”Optimality and duality for complex nondifferentiabl fractional programming”, J. Math. Anal. Appl. 210 (1997), 804-824. [20] N. Levinson, ”Linear programming in complex space”, J. Math. Anal. Appl. 14 (1966), 44-62. [21] B. Mond and B. D. Craven, ”A class of nondifferentiable complex programming problems”, J. Math. Oper. und Stat. 6 (1975), 581-591. [22] O. Parkash, P. C. Saxena, and V. Paktar, ”Nondifferentiable fractional programming in complex space”, Z. Angew. Math. Mech. 64 (1984), 59-62. [23] W. E. Schmittendorff, ”Necessary conditions and sufficient conditions for static minmax problems”, J. Math. Anal. Appl. 57 (1977), 683-693. [24] I. Smart and B. Mond, ”Complex nonlinear programming: duality with invexity and equivalent real programs”, J. Optim. Theory Appl. 69 (1991), 469-488. [25] K. Swarup and I.C. Sharma, ”Programming with linear fractional functional in complex space”, Cahiers Center d’Etudes Recherche Operationelle 2 (1970), 103-109. [26] T. Weir, ”Pseudoconvex minmax programming”, Util. Math. 42 (1992), 234-240. [27] T. Weir and B. Mond, ”Generalized convexity and duality for complex programming problem”, Cahiers de C. E. R. O. 26 (1984), 137-142.
[1] I. Ahman, Z. Husain, Nondifferentiable second order symmetric duality in multiobjective programming, Appl. Math. Lett. 18 (2005) 721-728. [2] C.R. Bector, S. Chandra, I. Husain, Second order duality for a minimax programming problem, Opserarch 28 (1991) 249-263. [3] W.E. Schmittendorf, Necessary conditions and sufficient conditions for static minimax problems, J. Math. Anal. Appl. 57 (1977) 683-693. [4] J. Zhang, B. Mond, Second order B-invexity and duality in mathematical programming, Util. Math. 50 (1996) 19-31.
|