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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dantzig, G.B.: Discrete variable extremum problems. Oper. Res. 5, 266–277 (1957)
Del Pia, A., Dey, S.S., Molinaro, M.: Mixed-integer quadratic programming is in NP. Manuscript (2014)
Glover, F.: New results on equivalent integer programming formulations. Math. Prog. 8, 84–90 (1975)
Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discrete Math. 16, 39–52 (1976)
Jeroslow, R.: Representations of unbounded optimizations as integer programs. J. Optim. Theory Appl. 30, 339–351 (1980)
Jeroslow, R.G.: Representability in mixed integer programming, i: characterization results. Discrete Appl. Math. 17, 223–243 (1987)
Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. Math. Prog. Study 22, 167–184 (1984)
Meyer, R.R.: Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16(3/4), 191–206 (1975)
Meyer, R.R.: Mixed-integer minimization models for piecewise-linear functions of a single variable. Discrete Math. 16, 163–171 (1976)
Meyer, R.R., Thakkar, M.V., Hallman, W.P.: Rational mixed integer and polyhedral union minimization models. Math. Oper. Res. 5, 135–146 (1980)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)