IDEAS home Printed from https://ideas.repec.org/a/spr/decfin/v40y2017i1d10.1007_s10203-017-0196-6.html
   My bibliography  Save this article

Generating the efficient frontier of a class of bicriteria generalized fractional programming

Author

Listed:
  • Riccardo Cambini

    (University of Pisa)

  • Laura Carosi

    (University of Pisa)

  • Laura Martein

    (University of Pisa)

Abstract

In this paper, a particular class of bicriteria maximization problems over a compact polyhedron is considered. The first component of the objective function is the ratio of powers of affine functions and the second one is linear. Several theoretical properties are provided, such as the pseudoconcavity of the first criterium of the objective function, the connectedness and compactness of both the efficient frontier and the set of efficient points. The obtained results allow us to propose a new simplex-like solution method for generating the whole efficient frontier; to better clarify the use of the suggested algorithm, several examples are described and the results of a computational test are presented.

Suggested Citation

  • Riccardo Cambini & Laura Carosi & Laura Martein, 2017. "Generating the efficient frontier of a class of bicriteria generalized fractional programming," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 81-101, November.
  • Handle: RePEc:spr:decfin:v:40:y:2017:i:1:d:10.1007_s10203-017-0196-6
    DOI: 10.1007/s10203-017-0196-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10203-017-0196-6
    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/s10203-017-0196-6?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. Igor V. Konnov & Dinh The Luc & Alexander M. Rubinov, 2006. "Generalized Convexity and Related Topics," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-37007-9, October.
    2. Riccardo Cambini & Laura Carosi & Laura Martein & Ezat Valipour, 2017. "Simplex-like sequential methods for a class of generalized fractional programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 77-96, February.
    3. A. Daniilidis & N. Hadjisavvas & S. Schaible, 1997. "Connectedness of the Efficient Set for Three-Objective Quasiconcave Maximization Problems," Journal of Optimization Theory and Applications, Springer, vol. 93(3), pages 517-524, June.
    4. Laura Martein & Valerio Bertolucci, 2007. "A Sequential Method for a Class of Bicriteria Problems," Lecture Notes in Economics and Mathematical Systems, in: Generalized Convexity and Related Topics, pages 347-358, Springer.
    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. E. K. Makarov & N. N. Rachkovski, 2001. "Efficient Sets of Convex Compacta are Arcwise Connected," Journal of Optimization Theory and Applications, Springer, vol. 110(1), pages 159-172, July.
    2. Leandro Nascimento, 2011. "Remarks on the consumer problem under incomplete preferences," Theory and Decision, Springer, vol. 70(1), pages 95-110, January.
    3. Davide LA TORRE & Nicolae POPOVICI & Matteo ROCCA, 2008. "Scalar characterization of explicitly quasiconvex set-valued maps," Departmental Working Papers 2008-01, Department of Economics, Management and Quantitative Methods at Università degli Studi di Milano.
    4. Arun Kumar Tripathy, 2021. "The Study Higher-order Wolfe-type Non-differentiable Multiple Objective Symmetric Duality Involving Generalized Convex Functions," SN Operations Research Forum, Springer, vol. 2(4), pages 1-18, December.
    5. I.V. Konnov, 2003. "On Lexicographic Vector Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 118(3), pages 681-688, September.
    6. M. M. Mäkelä & Y. Nikulin, 2009. "On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 143(3), pages 519-538, December.
    7. Ke Zhao & Xue Liu & Zhe Chen, 2011. "A class of r-semipreinvex functions and optimality in nonlinear programming," Journal of Global Optimization, Springer, vol. 49(1), pages 37-47, January.
    8. J. Benoist & N. Popovici, 2001. "Contractibility of the Efficient Frontier of Three-Dimensional Simply-Shaded Sets," Journal of Optimization Theory and Applications, Springer, vol. 111(1), pages 81-116, October.
    9. N. J. Huang & J. Li & S. Y. Wu, 2009. "Optimality Conditions for Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 323-342, August.
    10. D. T. Luc & S. Schaible, 1997. "Efficiency and Generalized Concavity," Journal of Optimization Theory and Applications, Springer, vol. 94(1), pages 147-153, July.
    11. Tadeusz Antczak, 2014. "On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems," Journal of Global Optimization, Springer, vol. 59(4), pages 757-785, August.
    12. Malti Kapoor, 2017. "Vector optimization over cones involving support functions using generalized $$(\Phi ,\rho )$$ ( Φ , ρ ) -convexity," OPSEARCH, Springer;Operational Research Society of India, vol. 54(2), pages 351-364, June.
    13. I. Konnov & D. Dyabilkin, 2011. "Nonmonotone equilibrium problems: coercivity conditions and weak regularization," Journal of Global Optimization, Springer, vol. 49(4), pages 575-587, April.
    14. A. Daniilidis & N. Hadjisavvas, 1999. "Characterization of Nonsmooth Semistrictly Quasiconvex and Strictly Quasiconvex Functions," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 525-536, September.
    15. J. Benoist, 2001. "Contractibility of the Efficient Set in Strictly Quasiconcave Vector Maximization," Journal of Optimization Theory and Applications, Springer, vol. 110(2), pages 325-336, August.
    16. Tran Quoc & Pham Anh & Le Muu, 2012. "Dual extragradient algorithms extended to equilibrium problems," Journal of Global Optimization, Springer, vol. 52(1), pages 139-159, January.
    17. J. Benoist, 1998. "Connectedness of the Efficient Set for Strictly Quasiconcave Sets," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 627-654, March.
    18. N. Q. Huy & N. D. Yen, 2005. "Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 615-635, March.
    19. Tran Quoc & Le Muu, 2012. "Iterative methods for solving monotone equilibrium problems via dual gap functions," Computational Optimization and Applications, Springer, vol. 51(2), pages 709-728, March.
    20. S.T. Hackman & U. Passy, 2002. "Maximizing a Linear Fractional Function on a Pareto Efficient Frontier," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 83-103, April.

    More about this item

    Keywords

    Bicriteria programming; Generalized fractional programming; Pseudoconcavity;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    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:decfin:v:40:y:2017:i:1:d:10.1007_s10203-017-0196-6. 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.