IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v199y2009i1p1-8.html
   My bibliography  Save this article

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

Author

Listed:
  • Benson, Harold P.
  • Sun, Erjiang

Abstract

This article presents a branch-and-reduce algorithm for globally solving for the first time a convex minimization problem (P) with p[greater-or-equal, slanted]1 additional multiplicative constraints. In each of these p additional constraints, the product of two convex functions is constrained to be less than or equal to a positive number. The algorithm works by globally solving a 2p-dimensional master problem (MP) equivalent to problem (P). During a typical stage k of the algorithm, a point is found that minimizes the objective function of problem (MP) over a nonconvex set Fk that contains the portion of the boundary of the feasible region of the problem where a global optimal solution lies. If this point is feasible in problem (MP), the algorithm terminates. Otherwise, the algorithm continues by branching and creating a new, reduced nonconvex set Fk+1 that is a strict subset of Fk. To implement the algorithm, all that is required is the ability to solve standard convex programming problems and to implement simple algebraic steps. Convergence properties of the algorithm are given, and results of some computational experiments are reported.

Suggested Citation

  • Benson, Harold P. & Sun, Erjiang, 2009. "Branch-and-reduce algorithm for convex programs with additional multiplicative constraints," European Journal of Operational Research, Elsevier, vol. 199(1), pages 1-8, November.
  • Handle: RePEc:eee:ejores:v:199:y:2009:i:1:p:1-8
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00769-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Kuno, Takahito & Yajima, Yasutoshi & Yamamoto, Yoshitsugu & Konno, Hiroshi, 1994. "Convex programs with an additional constraint on the product of several convex functions," European Journal of Operational Research, Elsevier, vol. 77(2), pages 314-324, September.
    2. H. P. Benson, 2005. "Decomposition Branch-and-Bound Based Algorithm for Linear Programs with Additional Multiplicative Constraints," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 41-61, July.
    3. Arthur M. Geoffrion, 1967. "Solving Bicriterion Mathematical Programs," Operations Research, INFORMS, vol. 15(1), pages 39-54, February.
    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. Erjiang Sun, 2017. "On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 236-246, 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. Hongwei Jiao & Binbin Li & Wenqiang Yang, 2024. "A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems," Journal of Global Optimization, Springer, vol. 89(3), pages 597-632, July.
    2. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    3. Kathrin Klamroth & Margaret M. Wiecek, 2002. "A Bi-Objective Median Location Problem With a Line Barrier," Operations Research, INFORMS, vol. 50(4), pages 670-679, August.
    4. Stefan Nickel, 1997. "Bicriteria and restricted 2-Facility Weber Problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(2), pages 167-195, June.
    5. Tan, Zhijia & Yang, Hai & Guo, Xiaolei, 2010. "Properties of Pareto-efficient contracts and regulations for road franchising," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 415-433, May.
    6. Hussein, Mohammad L. & Abd El-Ghaffar, F. S., 1996. "An interactive approach for vector optimization problems," European Journal of Operational Research, Elsevier, vol. 89(1), pages 185-192, February.
    7. Ke, Jintao & Li, Xinwei & Yang, Hai & Yin, Yafeng, 2021. "Pareto-efficient solutions and regulations of congested ride-sourcing markets with heterogeneous demand and supply," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    8. Ioana Popescu, 2007. "Robust Mean-Covariance Solutions for Stochastic Optimization," Operations Research, INFORMS, vol. 55(1), pages 98-112, February.
    9. Sanchita Sharma & Rita Malhotra & Shalini Arora, 2019. "Efficient triads related to transportation problem with common pivotal time," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 1353-1360, October.
    10. Boddiford, Ashley N. & Kaufman, Daniel E. & Skipper, Daphne E. & Uhan, Nelson A., 2023. "Approximating a linear multiplicative objective in watershed management optimization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 547-561.
    11. Lizhen Shao & Matthias Ehrgott, 2014. "An objective space cut and bound algorithm for convex multiplicative programmes," Journal of Global Optimization, Springer, vol. 58(4), pages 711-728, April.
    12. Cai, Zeen & Mo, Dong & Geng, Maosi & Tang, Wei & Chen, Xiqun Michael, 2023. "Integrating ride-sourcing with electric vehicle charging under mixed fleets and differentiated services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    13. Gao, YueLin & Zhang, Bo, 2023. "Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem," Chaos, Solitons & Fractals, Elsevier, vol. 175(P1).
    14. Zhijia Tan & Yadong Wang & Qiang Meng & Zhixue Liu, 2018. "Joint Ship Schedule Design and Sailing Speed Optimization for a Single Inland Shipping Service with Uncertain Dam Transit Time," Service Science, INFORMS, vol. 52(6), pages 1570-1588, December.
    15. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    16. T. Kuno, 1999. "Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 121-135, October.
    17. Yang, Hai & Yang, Teng, 2011. "Equilibrium properties of taxi markets with search frictions," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 696-713, May.
    18. Xiaoxian Ma & Qingzhen Zhao & Jilin Qu, 2008. "Robust portfolio optimization with a generalized expected utility model under ambiguity," Annals of Finance, Springer, vol. 4(4), pages 431-444, October.
    19. Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
    20. Stephan Helfrich & Tyler Perini & Pascal Halffmann & Natashia Boland & Stefan Ruzika, 2023. "Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 86(2), pages 417-440, June.

    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:eee:ejores:v:199:y:2009:i:1:p:1-8. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.