Skip to main content

On the Mixed Binary Representability of Ellipsoidal Regions

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9682))

Abstract

Representability results for mixed-integer linear systems play a fundamental role in optimization since they give geometric characterizations of the feasible sets that arise from mixed-integer linear programs. We consider a natural extension of mixed-integer linear systems obtained by adding just one ellipsoidal inequality. The set of points that can be described, possibly using additional variables, by these systems are called ellipsoidal mixed binary representable. In this work, we give geometric conditions that characterize ellipsoidal mixed binary representable sets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Dantzig, G.B.: Discrete variable extremum problems. Oper. Res. 5, 266–277 (1957)

    Article  MathSciNet  Google Scholar 

  2. Del Pia, A., Dey, S.S., Molinaro, M.: Mixed-integer quadratic programming is in NP. Manuscript (2014)

    Google Scholar 

  3. Glover, F.: New results on equivalent integer programming formulations. Math. Prog. 8, 84–90 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discrete Math. 16, 39–52 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jeroslow, R.: Representations of unbounded optimizations as integer programs. J. Optim. Theory Appl. 30, 339–351 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jeroslow, R.G.: Representability in mixed integer programming, i: characterization results. Discrete Appl. Math. 17, 223–243 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. Math. Prog. Study 22, 167–184 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Meyer, R.R.: Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16(3/4), 191–206 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Meyer, R.R.: Mixed-integer minimization models for piecewise-linear functions of a single variable. Discrete Math. 16, 163–171 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Meyer, R.R., Thakkar, M.V., Hallman, W.P.: Rational mixed integer and polyhedral union minimization models. Math. Oper. Res. 5, 135–146 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)

    MATH  Google Scholar 

  12. Villaverde, K., Kosheleva, O., Ceberio, M.: Why ellipsoid constraints, ellipsoid clusters, and Riemannian space-time: Dvoretzky’s theorem revisited. In: Ceberio, M., Kreinovich, V. (eds.) Constraint Programming and Decision Making. SCI, vol. 539, pp. 203–207. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeffrey Poskin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Del Pia, A., Poskin, J. (2016). On the Mixed Binary Representability of Ellipsoidal Regions. In: Louveaux, Q., Skutella, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 2016. Lecture Notes in Computer Science(), vol 9682. Springer, Cham. https://doi.org/10.1007/978-3-319-33461-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33461-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33460-8

  • Online ISBN: 978-3-319-33461-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics