IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v117y2003i3d10.1023_a1023993504522.html
   My bibliography  Save this article

Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets

Author

Listed:
  • H.A. Le Thi

    (National Institute for Applied Sciences—Rouen)

  • T. Pham Dinh

    (National Institute for Applied Sciences—Rouen)

  • L.D. Muu

    (Institute of Mathematics)

Abstract

We formulate optimization problems over efficient and weakly efficient sets as DC problems over a simplex in the criteria space. This formulation allows developing a decomposition algorithm using an adaptive simplex subdivision and a convex envelope function for solving both problems. Randomly generated problems up to the size of 150 decision variables and 7 criteria are solved.

Suggested Citation

  • H.A. Le Thi & T. Pham Dinh & L.D. Muu, 2003. "Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 503-531, June.
    • Handle: RePEc:spr:joptap:v:117:y:2003:i:3:d:10.1023_a:1023993504522
    DOI: 10.1023/A:1023993504522
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1023993504522
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1023993504522?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. James E. Falk & Karla R. Hoffman, 1976. "A Successive Underestimation Method for Concave Minimization Problems," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 251-259, August.
    2. R. Horst & N. V. Thoai, 1997. "Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 605-631, March.
    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. Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
    2. Harold P. Benson & S. Selcuk Erenguc, 1990. "An algorithm for concave integer minimization over a polyhedron," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 515-525, August.
    3. Harold P. Benson, 2006. "Maximizing the ratio of two convex functions over a convex set," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 309-317, June.
    4. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    5. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    6. Horst, Reiner & Thoai, Nguyen V., 1999. "Maximizing a concave function over the efficient or weakly-efficient set," European Journal of Operational Research, Elsevier, vol. 117(2), pages 239-252, September.
    7. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.
    8. Wei Chen & Milind Dawande & Ganesh Janakiraman, 2014. "Fixed-Dimensional Stochastic Dynamic Programs: An Approximation Scheme and an Inventory Application," Operations Research, INFORMS, vol. 62(1), pages 81-103, February.
    9. Queiroz, Marcelo & Humes, Carlos, 2003. "A heuristic for the continuous capacity and flow assignment," European Journal of Operational Research, Elsevier, vol. 146(3), pages 444-459, May.
    10. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. Nonas, Sigrid Lise & Thorstenson, Anders, 2000. "A combined cutting-stock and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 327-342, January.
    12. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    13. Torki, Abdolhamid & Yajima, Yatsutoshi & Enkawa, Takao, 1996. "A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 384-391, October.
    14. Thoai, Nguyen V., 2000. "A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 58-68, April.
    15. G. Pacelli & M. C. Recchioni, 2000. "Monotone Variable–Metric Algorithm for Linearly Constrained Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 255-279, February.
    16. Reiner Horst, 1990. "Deterministic methods in constrained global optimization: Some recent advances and new fields of application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 433-471, August.
    17. 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.
    18. R. Horst & N. V. Thoai, 1999. "DC Programming: Overview," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 1-43, October.
    19. R. Horst & N. V. Thoai & Y. Yamamoto & D. Zenke, 2007. "On Optimization over the Efficient Set in Linear Multicriteria Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 433-443, September.
    20. Bahman Kalantari & Ansuman Bagchi, 1990. "An algorithm for quadratic zero‐one programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 527-538, August.

    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:joptap:v:117:y:2003:i:3:d:10.1023_a:1023993504522. 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.