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

Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions

Author

Listed:
  • Laura Carosi

    (University of Pisa)

Abstract

The issue of the pseudoconvexity of a function on a closed set is addressed. It is proved that if a function has no critical points on the boundary of a convex set, then the pseudoconvexity on the interior guarantees the pseudoconvexity on the closure of the set. This result holds even when the boundary of the set contains line segments, and it is used to characterize the pseudoconvexity, on the nonnegative orthant, of a wide class of generalized fractional functions, namely the sum between a linear one and a ratio which has an affine function as numerator and, as denominator, the p-th power of an affine function. The relationship between quasiconvexity and pseudoconvexity is also investigated.

Suggested Citation

  • Laura Carosi, 2017. "Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 145-158, November.
  • Handle: RePEc:spr:decfin:v:40:y:2017:i:1:d:10.1007_s10203-017-0185-9
    DOI: 10.1007/s10203-017-0185-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10203-017-0185-9
    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-0185-9?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. Cambini, Riccardo & Sodini, Claudio, 2010. "A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions," European Journal of Operational Research, Elsevier, vol. 207(1), pages 25-29, November.
    2. Laura Carosi & Laura Martein, 2008. "A sequential method for a class of pseudoconcave fractional problems," 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. 16(2), pages 153-164, June.
    3. Laura Carosi & Laura Martein, 2013. "Characterizing the pseudoconvexity of a wide class of generalized fractional functions," Discussion Papers 2013/172, Dipartimento di Economia e Management (DEM), University of Pisa, Pisa, Italy.
    4. Alberto Cambini & Laura Martein, 2009. "Generalized Convexity and Optimization," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-70876-6, December.
    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. 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.
    2. Peiping Shen & Kaimin Wang & Ting Lu, 2020. "Outer space branch and bound algorithm for solving linear multiplicative programming problems," Journal of Global Optimization, Springer, vol. 78(3), pages 453-482, November.
    3. Riccardo Cambini & Claudio Sodini, 2014. "A parametric solution algorithm for a class of rank-two nonconvex programs," Journal of Global Optimization, Springer, vol. 60(4), pages 649-662, December.
    4. Peiping Shen & Dianxiao Wu & Kaimin Wang, 2023. "Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound," Journal of Global Optimization, Springer, vol. 86(2), pages 303-321, June.
    5. Laura Carosi & Laura Martein, 2013. "Characterizing the pseudoconvexity of a wide class of generalized fractional functions," Discussion Papers 2013/172, Dipartimento di Economia e Management (DEM), University of Pisa, Pisa, Italy.
    6. Boualem Alleche & Vicenţiu D. Rădulescu, 2017. "Further on Set-Valued Equilibrium Problems and Applications to Browder Variational Inclusions," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 39-58, October.
    7. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    8. A. Kabgani & F. Lara, 2023. "Semistrictly and neatly quasiconvex programming using lower global subdifferentials," Journal of Global Optimization, Springer, vol. 86(4), pages 845-865, August.
    9. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
    10. Kock, Anders Bredahl & Preinerstorfer, David & Veliyev, Bezirgen, 2023. "Treatment recommendation with distributional targets," Journal of Econometrics, Elsevier, vol. 234(2), pages 624-646.
    11. Delle Site, Paolo & Kilani, Karim & Gatta, Valerio & Marcucci, Edoardo & de Palma, André, 2019. "Estimation of consistent Logit and Probit models using best, worst and best–worst choices," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 87-106.
    12. Md. Sujan Miah & Md. Mominul Islam & Mahmudul Hasan & Abu Hashan Md. Mashud & Dipa Roy & Shib Sankar Sana, 2021. "A Discount Technique-Based Inventory Management on Electronics Products Supply Chain," JRFM, MDPI, vol. 14(9), pages 1-16, August.
    13. Md. Abdul Hakim & Ibrahim M. Hezam & Adel Fahad Alrasheedi & Jeonghwan Gwak, 2022. "Pricing Policy in an Inventory Model with Green Level Dependent Demand for a Deteriorating Item," Sustainability, MDPI, vol. 14(8), pages 1-16, April.
    14. Chinedu Izuchukwu & Yekini Shehu & Chibueze C. Okeke, 2023. "Extension of forward-reflected-backward method to non-convex mixed variational inequalities," Journal of Global Optimization, Springer, vol. 86(1), pages 123-140, May.
    15. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.
    16. Ping Ruan & Yung-Fu Huang & Ming-Wei Weng, 2022. "Impact of COVID-19 on Supply Chains: A Hybrid Trade Credit Policy," Mathematics, MDPI, vol. 10(8), pages 1-22, April.
    17. Giorgio Giorgi, 2021. "On Notations for Conic Hulls and Related Considerations on Tangent Cones," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 13(3), pages 1-13, June.
    18. Chen, Sheng-Chih & Teng, Jinn-Tsair & Skouri, Konstantina, 2014. "Economic production quantity models for deteriorating items with up-stream full trade credit and down-stream partial trade credit," International Journal of Production Economics, Elsevier, vol. 155(C), pages 302-309.
    19. Wu, Jiang & Chan, Ya-Lan, 2014. "Lot-sizing policies for deteriorating items with expiration dates and partial trade credit to credit-risk customers," International Journal of Production Economics, Elsevier, vol. 155(C), pages 292-301.
    20. Giorgio Giorgi, 2018. "A Guided Tour in Constraint Qualifications for Nonlinear Programming under Differentiability Assumptions," DEM Working Papers Series 160, University of Pavia, Department of Economics and Management.

    More about this item

    Keywords

    Pseudoconvexity; Quasiconvexity; Fractional programming;
    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-0185-9. 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.