IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v71y2010i1p165-180.html
   My bibliography  Save this article

Global optimization of a rank-two nonconvex program

Author

Listed:
  • Riccardo Cambini
  • Claudio Sodini

Abstract

In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral feasible region is proposed. The algorithm is based on the so called optimal level solutions method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm. Copyright Springer-Verlag 2010

Suggested Citation

  • Riccardo Cambini & Claudio Sodini, 2010. "Global optimization of a rank-two nonconvex program," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 165-180, February.
    • Handle: RePEc:spr:mathme:v:71:y:2010:i:1:p:165-180
    DOI: 10.1007/s00186-009-0289-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-009-0289-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-009-0289-2?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. Riccardo Cambini & Claudio Sodini, 2002. "A Finite Algorithm for a Particular D.C. Quadratic Programming Problem," Annals of Operations Research, Springer, vol. 117(1), pages 33-49, November.
    2. Alberto Cambini & Laura Martein, 2009. "Generalized Convexity and Optimization," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-70876-6, July.
    3. Riccardo Cambini & Claudio Sodini, 2008. "A sequential method for a class of box constrained quadratic programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(2), pages 223-243, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    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. 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. Riccardo Cambini & Giovanna D’Inverno, 2024. "Rank-two programs involving linear fractional functions," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 47(1), pages 299-325, June.
    5. 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.
    6. Riccardo Cambini, 2020. "Underestimation functions for a rank-two partitioning method," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 465-489, December.

    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, 2020. "Underestimation functions for a rank-two partitioning method," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 465-489, December.
    2. 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.
    3. Sorin-Mihai Grad & Felipe Lara, 2022. "An extension of the proximal point algorithm beyond convexity," Journal of Global Optimization, Springer, vol. 82(2), pages 313-329, February.
    4. 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.
    5. 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.
    6. Giorgio, 2019. "On Second-Order Optimality Conditions in Smooth Nonlinear Programming Problems," DEM Working Papers Series 171, University of Pavia, Department of Economics and Management.
    7. Li, Ruihai & Chan, Ya-Lan & Chang, Chun-Tao & Cárdenas-Barrón, Leopoldo Eduardo, 2017. "Pricing and lot-sizing policies for perishable products with advance-cash-credit payments by a discounted cash-flow analysis," International Journal of Production Economics, Elsevier, vol. 193(C), pages 578-589.
    8. Riccardo Cambini & Giovanna D’Inverno, 2024. "Rank-two programs involving linear fractional functions," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 47(1), pages 299-325, June.
    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. Al-Amin Khan, Md. & Shaikh, Ali Akbar & Konstantaras, Ioannis & Bhunia, Asoke Kumar & Cárdenas-Barrón, Leopoldo Eduardo, 2020. "Inventory models for perishable items with advanced payment, linearly time-dependent holding cost and demand dependent on advertisement and selling price," International Journal of Production Economics, Elsevier, vol. 230(C).
    12. Dye, Chung-Yuan & Yang, Chih-Te & Kung, Fang-Cheng, 2014. "A note on “Seller’s optimal credit period and cycle time in a supply chain for deteriorating items with maximum lifetime”," European Journal of Operational Research, Elsevier, vol. 239(3), pages 868-871.
    13. 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.
    14. A. Iusem & F. Lara, 2022. "Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 443-461, June.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:mathme:v:71:y:2010:i:1:p:165-180. 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.