Skip to main content
SpringerLink
Log in

Reformulation-Linearization Technique for Global Optimization

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A Level-2 Reformulation-Linearization Technique Bound for the Quadratic Assignment Problem. Eur J Oper Res 180(3):983–996

    Article  MATH  MathSciNet  Google Scholar 

  2. Adams WP, Johnson TA (1994) Improved linear programming‐based lower bounds for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS Series in Discret Mathematics and Theoretical Computer Science, vol 16. Providence, pp 43–75

    Google Scholar 

  3. Adams WP, Lassiter JB, Sherali HD (1998) Persistency in 0-1 optimization. Math Oper Res 23(2):359–389

    MATH  MathSciNet  Google Scholar 

  4. Adams WP, Sherali HD (1986) A tight linearization and an algorithm for zero-one quadratic programming problems. Manage Sci 32(10):1274–1290

    MATH  MathSciNet  Google Scholar 

  5. Adams WP, Sherali HD (1990) Linearization strategies for a class of zero-one mixed integer programming problems. Oper Res 38(2):217–226

    MATH  MathSciNet  Google Scholar 

  6. Adams WP, Sherali HD (1993) Mixed-integer bilinear programming problems. Math Program 59(3):279–306

    Article  MathSciNet  Google Scholar 

  7. Adams WP, Sherali HD (2005) A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Ann Oper Res 140(1):21–47

    Article  MATH  MathSciNet  Google Scholar 

  8. Balas E, Ceria S, Cornuejols G (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program 58(3):295–324

    Article  MathSciNet  Google Scholar 

  9. Boros E, Crama Y, Hammer PL (1990) Upper bounds for quadratic 0-1 maximization problems. Oper Res Lett 9:73–79

    Article  MATH  MathSciNet  Google Scholar 

  10. Liberti L (2004) Reduction constraints for the global optimization of NLPs. Int Trans Oper Res 11(1):34–41

    Article  MathSciNet  Google Scholar 

  11. Liberti L (2004) Reformulation and convex relaxation techniques for global optimization. 4OR 2:255–258

    Google Scholar 

  12. Liberti L (2005) Linearity embedded in nonconvex programs. J Glob Optim 33(2):157–196

    Article  MATH  MathSciNet  Google Scholar 

  13. Liberti L (2007) Compact linearization of binary quadratic problems. 4OR. doi: 10.1007/s10288-006-0015-3

    Google Scholar 

  14. Liberti L, Lavor C, Maculan N, Chaer Nascimento MA: Reformulation in mathematical programming: an application to quantum chemistry. Discret Appl Math, submitted

    Google Scholar 

  15. Liberti L, Pantelides CC (2006) An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J Glob Optim 36:161–189

    Article  MATH  MathSciNet  Google Scholar 

  16. Lovasz L, Schrijver A (1990) Cones of matrices and set functions, and 0-1 optimization. SIAM J Optim 1:166–190

    Article  MathSciNet  Google Scholar 

  17. Sherali HD (1997) Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math Vietnamica 22(1):245–270

    MATH  MathSciNet  Google Scholar 

  18. Sherali HD (1998) Global optimization of nonconvex polynomial programming problems having rational exponents. J Glob Optim 12(3):267–283

    Article  MATH  MathSciNet  Google Scholar 

  19. Sherali HD (2002) Tight Relaxations for nonconvex optimization problems using the reformulation‐linearization/convexification technique (RLT). In: Pardalos PM, Romeijn HE (eds) Heuristic Approaches. Handbook of Global Optimization, vol 2. Kluwer, Dordrecht, pp 1–63

    Google Scholar 

  20. Sherali HD, Adams WP (1984) A decomposition algorithm for a discrete location‐allocation problem. Oper Res 32(4):878–900

    MATH  Google Scholar 

  21. Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discret Math 3(3):411–430

    Article  MATH  MathSciNet  Google Scholar 

  22. Sherali HD, Adams WP (1994) A hierarchy of relaxations and convex hull characterizations for mixed‐integer zero-one programming problems. Discret Appl Math 52:83–106

    Article  MATH  MathSciNet  Google Scholar 

  23. Sherali HD, Adams WP (1994) A reformulation-linearization technique (RLT) for solving discrete and continuous nonconvex programming problems. In: Gupta O (ed) XII-A Mathematics Today, special issue on Recent Advances in Mathematical Programming. pp 61–78

    Google Scholar 

  24. Sherali HD, Adams WP (1996) Computational advances using the reformulation-linearization technique (RLT) to solve discrete and continuous nonconvex problems. OPTIMA 49:1–6

    Google Scholar 

  25. Sherali HD, Adams WP (1999) A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Dordrecht

    MATH  Google Scholar 

  26. Sherali HD, Adams WP (2006) Extension of a reformulation‐linearization technique (RLT) to semi-infinite and convex programs under mixed 0-1 and general discrete restrictions. Manuscript, Dept. of Industrial Systems Engineering, Virginia Polytechnic Institute, Blacksburg, USA

    Google Scholar 

  27. Sherali HD, Adams WP, Driscoll P (1998) Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper Res 46(3):396–405

    Article  MATH  MathSciNet  Google Scholar 

  28. Sherali HD, Alameddine A (1992) A new reformulation-linearization technique for solving bilinear programming problems. J Glob Optim 2:379–410

    Article  MATH  MathSciNet  Google Scholar 

  29. Sherali HD, Al-Loughani I, Subramanian S (2002) Global optimization procedures for the capacitated Euclidean and l p distance multifacility location‐allocation problems. Oper Res 50(3):433–448

    Article  MathSciNet  MATH  Google Scholar 

  30. Sherali HD, Brown EL (1994) A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 16. Providence, pp 343–364

    Google Scholar 

  31. Sherali HD, Desai J (2005) A global optimization RLT-based approach for solving the hard clustering problem. J Glob Optim 32:281–306

    Article  MATH  MathSciNet  Google Scholar 

  32. Sherali HD, Desai J (2005) A global optimization RLT-based approach for solving the fuzzy clustering problem. J Glob Optim 33:597–615

    Article  MATH  MathSciNet  Google Scholar 

  33. Sherali HD, Desai J (2005) On solving polynomial, factorable, and black-box optimization problems using the RLT methodology. In: Audet C, Hansen P, Savard G (eds) Essays and Surveys on Global Optimization. Springer, New York, pp 131–163

    Chapter  Google Scholar 

  34. Sherali HD, Driscoll PJ (2002) On tightening the relaxation of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems. Oper Res 50(4):656–669

    Article  MathSciNet  MATH  Google Scholar 

  35. Sherali HD, Fraticelli BMP (2002) Enhancing RLT relaxations via a new class of semidefinite cuts. J Glob Optim 22(1–4):233–261

    Article  MATH  MathSciNet  Google Scholar 

  36. Sherali HD, Ganesan V (2003) A pseudo-global optimization approach with application to the design of containerships. J Glob Optim 26(4):335–360

    Article  MATH  MathSciNet  Google Scholar 

  37. Sherali HD, Krishnamurty R, Al-Khayyal FA (1998) Enumeration approach for linear complementarity problems based on a reformulation-linearization technique. J Optim Theory Appl 99(2):481–507

    Article  MATH  MathSciNet  Google Scholar 

  38. Sherali HD, Lee Y (1995) Sequential and simultaneous liftings of minimal cover inequalities for GUB constrained knapsack polytopes. SIAM J Discret Math 8(1):133–153

    Article  MATH  MathSciNet  Google Scholar 

  39. Sherali HD, Lee Y (1996) Tighter representations for set partitioning problems via a reformulation-linearization approach. Discret Appl Math 68:153–167

    Article  MATH  MathSciNet  Google Scholar 

  40. Sherali HD, Lee Y, Adams WP (1995) A Simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope. Oper Res Lett 17(1):19–26

    Article  MATH  MathSciNet  Google Scholar 

  41. Sherali HD, Ramachandran S, Kim S (1994) A localization and reformulation discrete programming approach for the rectilinear distance location‐allocation problem. Discret Appl Math 49(1–3):357–378

    Article  MATH  MathSciNet  Google Scholar 

  42. Sherali HD, Sarin SC, Tsai PF (2006) A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discret Optim 3:20–32

    Article  MATH  MathSciNet  Google Scholar 

  43. Sherali HD, Smith EP (1997) A global optimization approach to a water distribution network problem. J Glob Optim 11:107–132

    Article  MATH  MathSciNet  Google Scholar 

  44. Sherali HD, Subramanian S, Loganathan GV (2001) Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality. J Glob Optim 19:1–26

    Article  MATH  MathSciNet  Google Scholar 

  45. Sherali HD, Tuncbilek CH (1992) A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J Glob Optim 2:101–112

    Article  MATH  MathSciNet  Google Scholar 

  46. Sherali HD, Tuncbilek CH (1992) A squared-Euclidean distance location‐allocation problem. Nav Res Logist 39:447–469

    Article  MATH  MathSciNet  Google Scholar 

  47. Sherali HD, Tuncbilek CH (1995) A reformulation‐convexification approach for solving nonconvex quadratic programming problems. J Glob Optim 7:1–31

    Article  MATH  MathSciNet  Google Scholar 

  48. Sherali HD, Tuncbilek CH (1997) New reformulation-linearization technique based relaxations for univariate and multivariate polynomial programming problems. Oper Res Lett 21(1):1–10

    Article  MATH  MathSciNet  Google Scholar 

  49. Sherali HD, Wang H (2001) Global optimization of nonconvex factorable programming problems. Math Program 89(3):459–478

    Article  MATH  MathSciNet  Google Scholar 

  50. Stubbs RA, Mehrotra S (1999) A branch-and-cut method for 0-1 mixed convex programming. Math Program 86:515–532

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, USA

    Hanif D. Sherali

  2. LIX, Ecole Polytechnique, Palaiseau, France

    Leo Liberti

Authors
  1. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leo Liberti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Sherali, H.D., Liberti, L. (2008). Reformulation-Linearization Technique for Global Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_559

Download citation

Publish with us

Policies and ethics

Search

Navigation