Communications of the Korean Mathematical Society (대한수학회논문집)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH A MODIFIED OBJECTIVE FUNCTION

  • Kim, Do-Sang (Division of Mathematical Sciences Pukyong National University)
  • Published : 2005.10.01
Download PDF
⟨ Previous Next ⟩

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

References

  1. T. Antczak, A new approach to multiobjective programming with a modified objective function, J. Global Optim. 27 (2003), 485-495 https://doi.org/10.1023/A:1026080604790
  2. S. Brumelle, Duality for multiple objective convex programs, Math. Oper. Res. 6 (1981), 159-172 https://doi.org/10.1287/moor.6.2.159
  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 https://doi.org/10.1080/02331939508844092
  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 https://doi.org/10.1007/BF00933935
  7. Z. A. Khan and M. A. Hanson, On ration invexity in mathematical programming, J. Math. Anal. Appl. 205 (1997), 330-336 https://doi.org/10.1006/jmaa.1997.5180
  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 https://doi.org/10.1017/S000497270000277X

Cited by

  1. On fractional vector optimization over cones with support functions vol.13, pp.2, 2016, https://doi.org/10.3934/jimo.2016031
  2. Branch and bound computational method for multi-objective linear fractional optimization problem 2016, https://doi.org/10.1007/s00521-016-2243-6