Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity

The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development for sums of fractional programming problems is restricted to single objective problems. In this paper, some new optimality conditions are proposed for the sum of a fractional multiobjective optimization problem with generalized invexity. The optimality conditions are obtained by using a modified objective approach and equivalency with the original problem is established.

Anahtar Kelimeler:

Multiobjective programming, sum of ratio, multiobjective linear fractional programming, optimality and duality, saddle point criteria

Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity

Keywords:

Multiobjective programming, sum of ratio, multiobjective linear fractional programming, optimality and duality, saddle point criteria,

PDF

___

Benson HP. Global optimization algorithm for the nonlinear sum of ratios problem. J Optim Theory Appl 2002; : 1–29.
Benson HP. Generating sum of ratios test problems in global optimization. –621. J Optim Theory Appl 2003; 119:
Benson HP. On the global optimization of sums of linear fractional functions over a convex set. J Optim Theory Appl 2004; 121: 19–39.
Benson HP. Solving sum of ratios fractional programs via concave minimization. J Optim Theory Appl 2007; 135: –17.
Benson HP. A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratio problem. Eur J Oper Res 2007; 182: 597–611.
Benson HP. Branch-and-bound outer approximation algorithms for sum-of-ratios. J Optim Theory Appl 2010; 146: –18.
Chen HJ. Generic algorithm for generalized fractional programming. J Optim Theory Appl 2010; 146: 1–18.
Freund RW, Jarre F. Solving the sum-of-ratios problem by an interior-point method. J Global Optim 2001; 19: –102.
Gao Y, Jin S. A global optimization algorithm for sum of linear ratios problem. J Appl Math 2013; 2013: 276245.
Hackman ST, Passy U.Maximizing linear fractional function on a pareto eﬃcient frontier. J Optim Theory Appl ; 113: 83–103. Henson MA. On suﬃciency of the Kuhn-Tucker conditions. J Math Anal Appl 1981; 80: 545–550.
Jaberipour M, Khorram E. Solving the sum-of-ratios problem by a harmony search algorithm. J Comput Appl Math 2010; 234: 733–742.
Jiao H, Shen P. A note on the paper global optimization of non-linear sum of ratios. Appl Math Comput 2007; : 1812–1815.
Jin L, Hou XP. Global optimization for a class of nonlinear sums of ratios problems. Mathematical Problems in Engineering 2014; 2014: 103569.
John F. Extremum problems with inequalities as subsidiary conditions. In: Friedrichs KO, Neugebauer OE, Stocker JJ, editors. Studies and Essay: Courant Anniversary Volume. New York, NY, USA: Interscience Publisher, 1948, pp. 543–560
Kanno H. Minimization of ratio of function defined as sum of the absolute values. J Optim Theory Appl 2007; 135: –17.
Kim DS. Multiobjective fractional programming with a modified objective function. Commun Korean Math Soc ; 20: 837–847. Kuhn HW, Tucker AW. Nonlinear programming. In: Neyman J, editor. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. Berkeley, CA, USA: University of California Press, 1951, pp. 481–492.
Mishra SK. Generalized Convexity and Vector Optimization: Nonconvex Optimization and its Applications. Berlin, Germany: Springer-Verlag, 2009.
Pareto V. Course d’economie politique. 1st ed. Geneva, Switzerland: Libraire Drotz, 1897 (in French).
Qu SJ, Zhang KC, Zhao JK. An eﬃcient algorithm for globally minimizing sum of quadratics ratios problem with non-convex quadratics constraints. Appl Math Comput 2007; 189: 1624–1636.
Schaible S, Shi J. Fractional programming the sum-of-ratio case. Optim Meth Softw 2003; 18: 219–229.
Schaible S. A note on the sum of a linear and linear-fractional function. Naval Research Logistic Quarterly 1977; : 691–963.
Scott CH, Jeﬀerson TR. Duality of nonconvex sum of ratios. J Optim Theory Appl 1998; 98: 151–159.
Shen P, Chen Y, Yuan M. Solving sum of quadratic ratios fractional programs via monotonic function. Appl Math Comput 2009; 212: 234–244.
Shen P, Duan YP, Pei YG. A simplical branch and duality bound algorithm for the sum of convex-convex ratios problem. J Comput Appl Math 2009; 223: 145–158.
Shen P, Jin L. Using canonical partition to globally maximizing the non-linear sum of ratios. Appl Math Model ; 34: 2396–2413.
Shen P, Li W, Bai X. Maximizing for the sum of ratios of two convex functions over a convex set. Comput Oper Res 2013; 40: 2301–2307.
Shen P, Wang CF. Global optimization for sum of generalization fractional functions. J Comput Appl Math 2008; : 1–12.
Shen PP, Wang CF. Global optimization for sum of ratios problem with coeﬃcient. Appl Math Comput 2006; 176: –229.
Singh S, Gupta P. On multiparametric analysis in sum-of-ratios programming. In: Proceedings of the International Multiconference of Engineers and Computer Scientists, IMECS; 17–19 March 2010; Hong Kong.
Wang YJ, Zhang KC. Global optimization of non-linear sum of ratios problem. Appl Math Model 2004; 158: –330.