JOURNAL BROWSE
Search
Advanced SearchSearch Tips
MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH A MODIFIED OBJECTIVE FUNCTION
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH A MODIFIED OBJECTIVE FUNCTION
Kim, Do-Sang;
  PDF(new window)
 Abstract
We consider multiobjective fractional programming problems with generalized invexity. An equivalent multiobjective programming problem is formulated by using a modification of the objective function due to Antczak. We give relations between a multiobjective fractional programming problem and an equivalent multiobjective fractional problem which has a modified objective function. And we present modified vector saddle point theorems.
 Keywords
efficient solutions;weakly efficient solutions;invex functions;optimality conditions;vector saddle points;
 Language
English
 Cited by
1.
ON LINEARIZED VECTOR OPTIMIZATION PROBLEMS WITH PROPER EFFICIENCY,;

Journal of applied mathematics & informatics, 2009. vol.27. 3_4, pp.685-692
2.
ON APPROXIMATED PROBLEMS FOR LOCALLY LIPSCHITZ OPTIMIZATION PROBLEMS,;

Journal of applied mathematics & informatics, 2010. vol.28. 1_2, pp.431-438
1.
Branch and bound computational method for multi-objective linear fractional optimization problem, Neural Computing and Applications, 2016  crossref(new windwow)
2.
On fractional vector optimization over cones with support functions, Journal of Industrial and Management Optimization, 2016, 12, 4, 31  crossref(new windwow)
 References
1.
T. Antczak, A new approach to multiobjective programming with a modified objective function, J. Global Optim. 27 (2003), 485-495 crossref(new window)

2.
S. Brumelle, Duality for multiple objective convex programs, Math. Oper. Res. 6 (1981), 159-172 crossref(new window)

3.
L. N. Das and S. Nanda, Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions, Optimization 34 (1995), 43-51 crossref(new window)

4.
M. A. Geoffrion, Proper efficiency and the theory of vector maximization, J. Math. Anal. Appl. 22 (1968), 613-630

5.
E. H. Ivanov and R. Nehse, Some results on dual vector optimization problems, Optimization 4 (1985), 505-517

6.
P. Kanniappan, Necessary conditions for optimality of nondifferentiable convex multiobjective programming, J. Optirn. Theroy Appl. 40 (1983), 167-174 crossref(new window)

7.
Z. A. Khan and M. A. Hanson, On ration invexity in mathematical programming, J. Math. Anal. Appl. 205 (1997), 330-336 crossref(new window)

8.
O. L. Mangasarian, Nonlinear Programming, McGraw-Hill, New York, 1969

9.
P. Ruiz-Canales and A. Rufian-Lizana, A characterization of weakly efficient points, Math. Program. 68 (1995), 205-212

10.
T. Weir, B. Mond, and B. D. Craven, On duality for weakly minimized vector valued optimization problems, Optimization 11 (1986), 711-721

11.
T. Weir and B. Mond, Generalized convexity and duality in multiple objective programming, Bull. Austral. Math. Soc. 39 (1989), 287-299 crossref(new window)