Skip to main content
SpringerLink
Log in

Multi-Quadratic Integer Programming: Models and Applications

  • Reference work entry
Encyclopedia of Optimization

  • 210 Accesses

Article Outline

Keywords and Phrases

Introduction

Multi-Quadratic Integer Program

Applications

  Bilinear Problem

  Minimax Problem

  Mixed Integer Problem

Solution Techniques

Linear Forms of MQIP

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, Forrester RJ (2005) A simple recipe for concise mixed 0‑1 linearizations. Oper Res Lett 33:55–61

    Article  MATH  Google Scholar 

  2. Adams WP, Forrester RJ, Glover FW (2004) Comparison and enhancement strategies for linearizing mixed 0‑1 quadratic programs. Discret Optim 1:99–120

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Aharon B-T, Teboulle M (1996) Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math Program 72:51-639

    Google Scholar 

  7. Al-Khayyal FA (1992) Generalized bilinear programming: Part I. Models, applications and linear programming relaxation. Eur J Oper Res 60:306–314

    Article  MATH  Google Scholar 

  8. Al-Khayyal FA, Horst R, Pardalos PM (1992) Global optimization of concave functions subject to separable quadratic constraints: An application to bilevel programming. Ann Oper Res 34:125–147

    Article  MathSciNet  MATH  Google Scholar 

  9. Al-Khayyal FA, Larsen C, van Voorhis T (1995) A relaxation method for nonconvex quadratically constrained quadratic programs. J Glob Optim 6:215–230

    Article  MATH  Google Scholar 

  10. Al-Khayyal FA, van Voorhis T (1996) Accelerating convergence of branch-and-bound algorithms for quadratically constrained optimization problems. In: Floudas CA (ed) State of the art in global optimization: computational methods and applications. Kluwer, Dordrecht

    Google Scholar 

  11. Audet C, Hansen P, Jaumard B, Savard G (2000) A branch and cut algorithms for nonconvex quadratically constrained program. Math Program 87:131–152

    MathSciNet  MATH  Google Scholar 

  12. Baron DP (1972) Quadratic programming with quadratic constraints. Nav Res Logist Q 19:253–260

    Article  MathSciNet  MATH  Google Scholar 

  13. Bazaraa MS, Sherali HD (1980) Benders' partitioning applied to a new formulation of the quadratic assignment problem. Nav Res Logist Q 27(1):28–42

    Article  MathSciNet  Google Scholar 

  14. Ben-Tal A, Zibulevsky M (1997) Penalty/Barrier multiplier methods for convex programming problems. SIAM J Optim 7(2):347–366

    Article  MathSciNet  MATH  Google Scholar 

  15. Ben-Saad S (1989) An algorithm for a class of nonlinear convex optimization problems. PhD thesis. University of California, Los Angeles

    Google Scholar 

  16. Chaovalitwongse WA, Pardalos PM, Prokoyev OA (2004) Reduction of Multi-Quadratic 0‑1 Programming Problems to Linear Mixed 0‑1 Programming Problems. Oper Res Lett 32(6):517–522

    Article  MathSciNet  MATH  Google Scholar 

  17. Evans DH (1963) Modular design – A special case in nonlinear programming. Oper Res 11:637–647

    Article  MATH  Google Scholar 

  18. Evans DH (1970) A note on modular design – A special case in nonlinear programming. Oper Res 18:562–564

    Article  Google Scholar 

  19. Falk JE, Soland RM (1969) An algorithm for separable nonvox programming problems. Manag Sci 15(9):550–569

    Article  MathSciNet  MATH  Google Scholar 

  20. Filar JA, Schultz TA (1987) Bilinear programming and structured stochastic games. J Optim Theor Appl 53(1):85–104

    Article  MathSciNet  MATH  Google Scholar 

  21. Floudas CA, Visweswaran V (1995) Quadratic optimization. In: Horst R, Pardalos PM (eds) Handbook of Global Optimization. Kluwer, Dordrecht, pp 217–269

    Google Scholar 

  22. Fortet R (1959) L'algèbre de Boole et ses Applications en Recherche Opérationnelle. Cah Cent Etudes Rech Oper 1:5–36

    MATH  Google Scholar 

  23. Fortet R (1960) Applications de l'algèbre de Boole et Recherche Opérationnelle. Rev Fr Informat Rech Oper 4:17–26

    Google Scholar 

  24. Glover F (1975) Improved linear integer programming formulation of nonlinear integer programs. Manag Sci 22:455–460

    Article  MathSciNet  Google Scholar 

  25. Glover F, Woolsey E (1973) Futher reduction of zero-one polynomial programs to zero-one linear programming. Oper Res 21(1):156–161

    Article  MathSciNet  MATH  Google Scholar 

  26. Glover F, Woolsey E (1974) Converting the 0‑1 Polynomial Programming Program to a 0‑1 Linear Program. Oper Res 22(1):180‑182

    Google Scholar 

  27. Hansen P (1979) Methods of nonlinear 0‑1 programming. Ann Discret Math 5:53–70

    Article  MATH  Google Scholar 

  28. Hansen P, Jaumard B (1992) Reduction of indefinite quadratic programs to bilinear programs. J Glob Optim 2:41–60

    Article  MathSciNet  MATH  Google Scholar 

  29. Horst R, Pardalos PM, Thoai NV (1995) Introduction to global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  30. Iasemidis LD, Pardalos PM, Shiau D-S, Chaovalitwongse WA, Narayanan K, Kumar S, Carney PR, Sackellares JC (2003) Prediction of Human Epileptic Seizures based on Optimization and Phase Changes of Brain Electrical Activity. Optim Methods Softw 18(1):81–104

    Article  MathSciNet  MATH  Google Scholar 

  31. Kuhn HW, Tucker AW (1951) Nonlinear Programming. In: Nayman J (ed) Proceedings of the Second Berkeley Symposium on Math. Stat. and Prob. University of California Press, Berkeley, pp 481–492

    Google Scholar 

  32. Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2):251–282

    Article  MathSciNet  MATH  Google Scholar 

  33. Nesterov YE, Nemirovskii AA (1994) Interior Point Polynomial Methods in Convex Programming. In: SIAM Series in Applied Mathematics. SIAM, Philadelphia

    Google Scholar 

  34. Pardalos PM, Chaovalitwongse WA, Iasemidis LD, Sackellares JC, Shiau D-S, Carney PR, Prokopyev OA, Yatsenko VA (2004) Seizure Warning Algorithm Based on Spatiotemporal Dynamics of Intracranial EEG. Math Program 101(2):365–385

    Article  MathSciNet  MATH  Google Scholar 

  35. Pardalos PM, Glick JH, Rosen JB (1987) Global minimization of indefinite quadratic problems. Computing 39:281–291

    Article  MathSciNet  MATH  Google Scholar 

  36. Pardalos PM, Iasemidis LD, Shiau D-S, Sackellares JC (2001) Quadratic binary programming and dynamic system approach to determine the predictability of epileptic seizures. J Comb Optim 5(1):9–26

    Article  MathSciNet  MATH  Google Scholar 

  37. Pardalos PM, Jha S (1991) Graph separation techniques for quadratic zero-one programming. Comput Math Appl 21(6/7):107–113

    Article  MathSciNet  MATH  Google Scholar 

  38. Pardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic 0‑1 programming. Computing 45:131–144

    Article  MathSciNet  MATH  Google Scholar 

  39. Pardalos PM, Rodgers GP (1990) Parallel branch and bound algorithm for quadratic zero-one on a hypercube architecture. Ann Oper Res 22:271–292

    Article  MathSciNet  MATH  Google Scholar 

  40. Pardalos PM, Rosen JB (1986) Methods for global concave minimization: A bibliographic survey. SIAM Rev 28(3):367–379

    Article  MathSciNet  MATH  Google Scholar 

  41. Petersen CC (1971) A note on transforming the product of variables to linear form in linear programs. Working Paper, Purdue University

    Google Scholar 

  42. Phan Huy Hao E (1982) Quadratically constrained quadratic programming: Some applications and a method for solution. Z Oper Res 26:105–119

    Google Scholar 

  43. Phing TQ, Tao PD, Hoai An LT (1994) A method for solving D.C. programming problems, application to fuel mixture nonconvex optimization problems. J Glob Optim 6:87–105

    Google Scholar 

  44. Raber U (1998) A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J Glob Optim 13:417–432

    Article  MathSciNet  MATH  Google Scholar 

  45. Rhys JMW (1970) A selection problem of shared fixed costs and network flows. Manag Sci 17:200–207

    Article  MATH  Google Scholar 

  46. Rutenberg DP, Shaftel TL (1971) Product design: Subassemblies for multiple markets. Manag Sci 18(4):B220–B231

    Article  Google Scholar 

  47. Sherali HD (2007) RLT: A unified approach for discrete and continuous nonconvex optimization. Ann Oper Res 147:185–193

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  49. 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  MathSciNet  MATH  Google Scholar 

  50. 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  MathSciNet  MATH  Google Scholar 

  51. Sherali HD, Adams WP (1999) A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  53. Soland RM (1971) An algorithm for separable nonvox programming problems II: Nonconvex constraints. Manag Sci 17(11):159

    Article  MathSciNet  Google Scholar 

  54. Stern RJ, Wolkowicz H (1995) Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J Optim 5:286–313

    Article  MathSciNet  MATH  Google Scholar 

  55. Swarup K (1966) Indefinite quadratic programming with a quadratic constraint. Ekonom Obz 4:69–75

    MathSciNet  Google Scholar 

  56. Van De Panne C (1966) Programming with a quadratic constraint. Manag Sci 12:709–815

    Google Scholar 

  57. Watters LJ (1967) Reduction of integer polynomial programming to zero-one linear programming problems. Oper Res 15:1171–117

    Article  Google Scholar 

  58. Zangwill WI (1965) Media selection by decision programming. J Advert Res 5(3):30–36

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Rutgers University, Piscataway, USA

    W. Art Chaovalitwongse

  2. Department of Civil Engineering, University of Minnesota, Minneapolis, USA

    Xiaozheng He

  3. Department of Civil and Environmental Engineering, Utah State University, Logan, USA

    Anthony Chen

Authors
  1. W. Art Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaozheng He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anthony Chen
    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

Chaovalitwongse, W.A., He, X., Chen, A. (2008). Multi-Quadratic Integer Programming: Models and Applications . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_433

Download citation

Publish with us

Policies and ethics

Search

Navigation