Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-016-0401-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ruiz, Juan P. & Grossmann, Ignacio E., 2012. "A hierarchy of relaxations for nonlinear convex generalized disjunctive programming," European Journal of Operational Research, Elsevier, vol. 218(1), pages 38-47.
- Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Yinrun Lyu & Li Chen & Changyou Zhang & Dacheng Qu & Nasro Min-Allah & Yongji Wang, 2018. "An interleaved depth-first search method for the linear optimization problem with disjunctive constraints," Journal of Global Optimization, Springer, vol. 70(4), pages 737-756, April.
- Harsha Nagarajan & Mowen Lu & Site Wang & Russell Bent & Kaarthik Sundar, 2019. "An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs," Journal of Global Optimization, Springer, vol. 74(4), pages 639-675, August.
- Jian, Jinbao & Pan, Shanshan & Yang, Linfeng, 2019. "Solution for short-term hydrothermal scheduling with a logarithmic size mixed-integer linear programming formulation," Energy, Elsevier, vol. 171(C), pages 770-784.
- Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, 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.- Novas, Juan M. & Ramello, Juan Ignacio & Rodríguez, María Analía, 2020. "Generalized disjunctive programming models for the truck loading problem: A case study from the non-alcoholic beverages industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
- N. V. Thoai, 2000. "Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 331-354, November.
- Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
- Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
- Sonia Cafieri & Jon Lee & Leo Liberti, 2010. "On convex relaxations of quadrilinear terms," Journal of Global Optimization, Springer, vol. 47(4), pages 661-685, August.
- Keith Zorn & Nikolaos Sahinidis, 2014. "Global optimization of general nonconvex problems with intermediate polynomial substructures," Journal of Global Optimization, Springer, vol. 59(2), pages 673-693, July.
- Tsao, Yu-Chung & Lu, Jye-Chyi & An, Na & Al-Khayyal, Faiz & Lu, Richard W. & Han, Guanghua, 2014. "Retailer shelf-space management with trade allowance: A Stackelberg game between retailer and manufacturers," International Journal of Production Economics, Elsevier, vol. 148(C), pages 133-144.
- Al-Khayyal, Faiz & Hwang, Seung-June, 2007. "Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model," European Journal of Operational Research, Elsevier, vol. 176(1), pages 106-130, January.
- Manuel Ruiz & Olivier Briant & Jean-Maurice Clochard & Bernard Penz, 2013. "Large-scale standard pooling problems with constrained pools and fixed demands," Journal of Global Optimization, Springer, vol. 56(3), pages 939-956, July.
- Dimitri J. Papageorgiou & Francisco Trespalacios, 2018. "Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 55-83, March.
- Can Li & Ignacio E. Grossmann, 2019. "A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables," Journal of Global Optimization, Springer, vol. 75(4), pages 921-947, December.
- Marco Locatelli, 2016. "Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes," Journal of Global Optimization, Springer, vol. 66(4), pages 629-668, December.
- Hezhi Luo & Xiaodong Ding & Jiming Peng & Rujun Jiang & Duan Li, 2021. "Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 180-197, January.
- Kristianto, Yohanes & Helo, Petri, 2014. "Product architecture modularity implications for operations economy of green supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 128-145.
- Wang, Yadong & Meng, Qiang & Du, Yuquan, 2015. "Liner container seasonal shipping revenue management," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 141-161.
- Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
- Francisco Trespalacios & Ignacio E. Grossmann, 2016. "Cutting Plane Algorithm for Convex Generalized Disjunctive Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 209-222, May.
- E Bustamante-Cedeño & S Arora, 2008. "Stochastic and minimum regret formulations for transmission network expansion planning under uncertainties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1547-1556, November.
- Kristianto, Yohanes & Helo, Petri, 2015. "Reprint of “Product architecture modularity implications for operations economy of green supply chains”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 63-80.
- Marco Locatelli, 2014. "A technique to derive the analytical form of convex envelopes for some bivariate functions," Journal of Global Optimization, Springer, vol. 59(2), pages 477-501, July.
More about this item
Keywords
Disjunctive programming; Non-convex optimization; Relaxations;All these keywords.
Statistics
Access and download statisticsCorrections
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:jglopt:v:67:y:2017:i:1:d:10.1007_s10898-016-0401-0. 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.