Abstract
We study valid inequalities for a set relevant for optimization models that have both binary indicator variables, which indicate positivity of associated continuous variables, and separable concave constraints. Such models reduce to a mixed-integer linear program (MILP) when the concave constraints are ignored, and to a nonconvex global optimization problem when the binary restrictions are ignored. In algorithms to solve such problems to global optimality, relaxations are traditionally obtained by using valid inequalities for the MILP ignoring the concave constraints, and by independently relaxing each concave constraint using the secant obtained from the bounds of the associated variable. We propose a technique to obtain valid inequalities that are based on both the MILP and the concave constraints. We begin by analyzing a low-dimensional set that contains a single binary indicator variable, a single concave constraint, and three continuous variables. Using this analysis, for the canonical Single Node Flow Set (SNFS), we demonstrate how to “tilt” a given valid inequality for the SNFS to obtain additional valid inequalities that account for separable concave functions of the arc flows. We present computational results demonstrating the utility of the new inequalities on a fixed plus concave cost transportation problem. To our knowledge, this is one of the first works that simultaneously convexifies both nonconvex functions and binary variables to strengthen the relaxations of practical mixed integer nonlinear programs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Atamtürk, A., Narayanan, V.: Conic mixed integer rounding cuts. Math. Program. 122, 1–20 (2010)
Balas, E.: Disjunctive programming. In: Annals of Discrete Mathematics 5: Discrete Optimization, pp. 3–51. North Holland (1979)
Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 427–444. Springer, Heidelberg (2012)
D’Ambrosio, C., Lodi, A., Wiese, S., Bragalli, C.: Mathematical programming techniques in water network optimization. Eur. J. Oper. Res. 243(3), 774–788 (2015)
Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 169–180. Springer, Heidelberg (2013)
Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Program. 106, 225–236 (2006)
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0–1 integer programs. Math. Program. 85, 439–467 (1999)
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Sequence independent lifting in mixed integer programming. J. Comb. Optim. 4(1), 109–129 (2000)
Guisewite, G.M., Pardalos, P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25, 75–100 (1990)
Horst, R., Tuy, H.: Global Optimization. Springer, New York (1993)
Humpola, J., Fügenschuh, A.: A new class of valid inequalities for nonlinear network design problems. Technical report 13–06, ZIB, Konrad-Zuse-Zentrum für Informationstechnik Berlin (2013)
Martin, A., Möller, M., Moritz, S.: Mixed integer models for the stationary case of gas network optimization. Math. Program. 105(2), 563–582 (2006)
Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 503–526 (2014)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, Hoboken (1988)
Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33(4), 842–861 (1985)
Papageorgiou, D.J., Toriello, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Fixed-charge transportation with product blending. Trans. Sci. 46(2), 281–295 (2012)
Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201–205 (1996)
Üster, H., Dilaveroğlu, S.: Optimization for design and operation of natural gas transmission networks. Appl. Energy 133, 56–69 (2014)
Van Roy, T., Wolsey, L.A.: Valid inequalities for mixed 0–1 programs. Discrete Appl. Math. 14(2), 199–213 (1986)
Acknowledgements
The work was supported in part by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Applied Mathematics program under contract number DE-AC02-06CH11357.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Lim, C.H., Linderoth, J., Luedtke, J. (2016). Valid Inequalities for Separable Concave Constraints with Indicator Variables. 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_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-33461-5_23
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)