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

Construction of Test Problems for Concave Minimization Under Linear and Nonlinear Constraints

Author

Listed:
  • K. Moshirvaziri

    (California State University)

Abstract

This paper presents a method for constructing test problems with known global solutions for concave minimization under linear constraints with an additional convex constraint and for reverse convex programs with an additional convex constraint. The importance of such a construction can be realized from the fact that the well known d.c. programming problem can be formulated in this form. Then, the method is further extended to generate test problems with more than one convex constraint, tight or untight at the global solution.

Suggested Citation

  • K. Moshirvaziri, 1998. "Construction of Test Problems for Concave Minimization Under Linear and Nonlinear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 83-108, July.
    • Handle: RePEc:spr:joptap:v:98:y:1998:i:1:d:10.1023_a:1022636914306
    DOI: 10.1023/A:1022636914306
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022636914306
    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:1022636914306?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. J. B. Rosen, 1983. "Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 215-230, May.
    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. Massimo Spadoni & Luciano Stefanini, 2012. "A Differential Evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization," Journal of Global Optimization, Springer, vol. 52(1), pages 171-192, January.

    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. 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.
    2. 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.
    3. Marcus Porembski, 2004. "Cutting Planes for Low-Rank-Like Concave Minimization Problems," Operations Research, INFORMS, vol. 52(6), pages 942-953, December.
    4. H. X. Phu & V. M. Pho & P. T. An, 2011. "Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 1-25, April.

    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:98:y:1998:i:1:d:10.1023_a:1022636914306. 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.