IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v74y2019i2d10.1007_s10898-019-00766-1.html
   My bibliography  Save this article

Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems

Author

Listed:
  • Washington Alves Oliveira

    (University of Campinas)

  • Marko Antonio Rojas-Medar

    (Universidad de Tarapacá)

  • Antonio Beato-Moreno

    (University of Sevilla)

  • Maria Beatriz Hernández-Jiménez

    (Universidad Pablo de Olavide)

Abstract

If $$x^*$$ x ∗ is a local minimum solution, then there exists a ball of radius $$r>0$$ r > 0 such that $$f(x)\ge f(x^*)$$ f ( x ) ≥ f ( x ∗ ) for all $$x\in B(x^*,r)$$ x ∈ B ( x ∗ , r ) . The purpose of the current study is to identify the suitable $$B(x^*,r)$$ B ( x ∗ , r ) of the local optimal solution $$x^*$$ x ∗ for a particular multiobjective optimization problem. We provide a way to calculate the largest radius of the ball centered at local Pareto solution in which this solution is optimal. In this process, we present the necessary and sufficient conditions for achieving a global Pareto optimal solution. The results of this investigation might be useful to determine stopping criteria in the algorithms development.

Suggested Citation

  • Washington Alves Oliveira & Marko Antonio Rojas-Medar & Antonio Beato-Moreno & Maria Beatriz Hernández-Jiménez, 2019. "Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems," Journal of Global Optimization, Springer, vol. 74(2), pages 233-253, June.
  • Handle: RePEc:spr:jglopt:v:74:y:2019:i:2:d:10.1007_s10898-019-00766-1
    DOI: 10.1007/s10898-019-00766-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00766-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10898-019-00766-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Benson, Harold P., 2006. "Fractional programming with convex quadratic forms and functions," European Journal of Operational Research, Elsevier, vol. 173(2), pages 351-369, September.
    2. Korhonen, Pekka & Yu, GuangYuan, 1998. "On computing objective function values in multiple objective quadratic-linear programming," European Journal of Operational Research, Elsevier, vol. 106(1), pages 184-190, April.
    3. Ammar, E.E., 2009. "On fuzzy random multiobjective quadratic programming," European Journal of Operational Research, Elsevier, vol. 193(2), pages 329-341, March.
    4. R. Osuna-Gómez & A. Rufián-Lizana & P. Ruíz-Canales, 2000. "Multiobjective fractional programming with generalized convexity," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 97-110, June.
    5. Z. A. Liang & H. X. Huang & P. M. Pardalos, 2001. "Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 611-619, September.
    6. Jonathan S. H. Kornbluth & Ralph E. Steuer, 1981. "Multiple Objective Linear Fractional Programming," Management Science, INFORMS, vol. 27(9), pages 1024-1039, September.
    7. Korhonen, Pekka & Yu, GuangYuan, 1997. "A reference direction approach to multiple objective quadratic-linear programming," European Journal of Operational Research, Elsevier, vol. 102(3), pages 601-610, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jeyakumar, V. & Li, G.Y. & Srisatkunarajah, S., 2013. "Strong duality for robust minimax fractional programming problems," European Journal of Operational Research, Elsevier, vol. 228(2), pages 331-336.
    2. Yue Qi, 2017. "On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 145-158, March.
    3. Pekka Korhonen & Guang Yuan Yu, 2000. "Quadratic Pareto Race," World Scientific Book Chapters, in: Yong Shi & Milan Zeleny (ed.), New Frontiers Of Decision Making For The Information Technology Era, chapter 7, pages 123-142, World Scientific Publishing Co. Pte. Ltd..
    4. Sakawa, Masatoshi & Kato, Kosuke, 1998. "An interactive fuzzy satisficing method for structured multiobjective linear fractional programs with fuzzy numbers," European Journal of Operational Research, Elsevier, vol. 107(3), pages 575-589, June.
    5. Feng Guo & Liguo Jiao, 2023. "A new scheme for approximating the weakly efficient solution set of vector rational optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 905-930, August.
    6. Xiaojun Lei & Zhian Liang, 2008. "Study on the Duality between MFP and ACP," Modern Applied Science, Canadian Center of Science and Education, vol. 2(6), pages 1-81, November.
    7. Birbil, S.I. & Frenk, J.B.G. & Zhang, S., 2004. "Generalized Fractional Programming With User Interaction," ERIM Report Series Research in Management ERS-2004-033-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. I. Ahmad & Z. Husain, 2006. "Optimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(2), pages 255-275, May.
    9. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    10. Ahlatcioglu, Mehmet & Tiryaki, Fatma, 2007. "Interactive fuzzy programming for decentralized two-level linear fractional programming (DTLLFP) problems," Omega, Elsevier, vol. 35(4), pages 432-450, August.
    11. V. Jeyakumar & G. Y. Li, 2011. "Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 292-303, November.
    12. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    13. Luhandjula, M.K. & Joubert, J.W., 2010. "On some optimisation models in a fuzzy-stochastic environment," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1433-1441, December.
    14. I. Ahmad & Z. Husain & S. Sharma, 2009. "Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 1-12, April.
    15. Bilbao, A. & Arenas, M. & Rodriguez, M.V. & Antomil, J., 2007. "On constructing expert Betas for single-index model," European Journal of Operational Research, Elsevier, vol. 183(2), pages 827-847, December.
    16. Li, Y.P. & Huang, G.H. & Zhang, N. & Nie, S.L., 2011. "An inexact-stochastic with recourse model for developing regional economic-ecological sustainability under uncertainty," Ecological Modelling, Elsevier, vol. 222(2), pages 370-379.
    17. Fengqiao Luo & Sanjay Mehrotra, 2021. "A geometric branch and bound method for robust maximization of convex functions," Journal of Global Optimization, Springer, vol. 81(4), pages 835-859, December.
    18. Ahmad, I. & Sharma, Sarita, 2008. "Symmetric duality for multiobjective fractional variational problems involving cones," European Journal of Operational Research, Elsevier, vol. 188(3), pages 695-704, August.
    19. Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    20. João Costa & Maria Alves, 2013. "Enhancing computations of nondominated solutions in MOLFP via reference points," Journal of Global Optimization, Springer, vol. 57(3), pages 617-631, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:74:y:2019:i:2:d:10.1007_s10898-019-00766-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.