Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-012-0024-z
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
- Hanif Sherali & Evrim Dalkiran & Jitamitra Desai, 2012. "Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts," Computational Optimization and Applications, Springer, vol. 52(2), pages 483-506, June.
- Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
- P. Nataraj & M. Arounassalame, 2011. "Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm," Journal of Global Optimization, Springer, vol. 49(2), pages 185-212, February.
- Hanif Sherali & Evrim Dalkiran, 2011. "Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs," Journal of Global Optimization, Springer, vol. 51(3), pages 377-393, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Brais González-Rodríguez & Joaquín Ossorio-Castillo & Julio González-Díaz & Ángel M. González-Rueda & David R. Penas & Diego Rodríguez-Martínez, 2023. "Computational advances in polynomial optimization: RAPOSa, a freely available global solver," Journal of Global Optimization, Springer, vol. 85(3), pages 541-568, March.
- Bissan Ghaddar & Ignacio Gómez-Casares & Julio González-Díaz & Brais González-Rodríguez & Beatriz Pateiro-López & Sofía Rodríguez-Ballesteros, 2023. "Learning for Spatial Branching: An Algorithm Selection Approach," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1024-1043, September.
- Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
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.- 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.
- Titi, Jihad & Garloff, Jürgen, 2019. "Matrix methods for the tensorial Bernstein form," Applied Mathematics and Computation, Elsevier, vol. 346(C), pages 254-271.
- 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.
- Brais González-Rodríguez & Joaquín Ossorio-Castillo & Julio González-Díaz & Ángel M. González-Rueda & David R. Penas & Diego Rodríguez-Martínez, 2023. "Computational advances in polynomial optimization: RAPOSa, a freely available global solver," Journal of Global Optimization, Springer, vol. 85(3), pages 541-568, March.
- Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.
- 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.
- Martin Ballerstein & Dennis Michaels, 2014. "Extended formulations for convex envelopes," Journal of Global Optimization, Springer, vol. 60(2), pages 217-238, October.
- Harold P. Benson, 2004. "Concave envelopes of monomial functions over rectangles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 467-476, June.
- İhsan Yanıkoğlu & Erinç Albey & Serkan Okçuoğlu, 2022. "Robust Parameter Design and Optimization for Quality Engineering," SN Operations Research Forum, Springer, vol. 3(1), pages 1-36, March.
- Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
- Marco Locatelli, 2016. "Non polyhedral convex envelopes for 1-convex functions," Journal of Global Optimization, Springer, vol. 65(4), pages 637-655, August.
- 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.
- Radu Baltean-Lugojan & Ruth Misener, 2018. "Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness," Journal of Global Optimization, Springer, vol. 71(4), pages 655-690, August.
- 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.
- Graça Gonçalves & Luís Gouveia & Margarida Pato, 2014. "An improved decomposition-based heuristic to design a water distribution network for an irrigation system," Annals of Operations Research, Springer, vol. 219(1), pages 141-167, August.
- Tiago Andrade & Fabricio Oliveira & Silvio Hamacher & Andrew Eberhard, 2019. "Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming," Journal of Global Optimization, Springer, vol. 73(4), pages 701-722, April.
- Vidal, Carlos J. & Goetschalckx, Marc, 2001. "A global supply chain model with transfer pricing and transportation cost allocation," European Journal of Operational Research, Elsevier, vol. 129(1), pages 134-158, February.
- M. M. Faruque Hasan, 2018. "An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems," Journal of Global Optimization, Springer, vol. 71(4), pages 735-752, August.
- Temitayo Ajayi & Seyedmohammadhossein Hosseinian & Andrew J. Schaefer & Clifton D. Fuller, 2024. "Combination Chemotherapy Optimization with Discrete Dosing," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 434-455, March.
- Akshay Gupte & Shabbir Ahmed & Santanu S. Dey & Myun Seok Cheon, 2017. "Relaxations and discretizations for the pooling problem," Journal of Global Optimization, Springer, vol. 67(3), pages 631-669, March.
More about this item
Keywords
Reformulation-linearization technique (RLT); Filtering strategies; Polynomial programming; Branch-and-bound;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:57:y:2013:i:4:p:1147-1172. 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.