Abstract
In this paper, we address the problem of infeasibility of systems defined by convex inequality constraints, where some or all of the variables are integer valued. In particular, we provide a polynomial time algorithm to identify a set of all constraints which may affect a feasibility status of the system after some perturbation of the right-hand sides. We establish several properties of the irreducible infeasible sets and infeasibility sets in the systems with integer variables, proving in particular that all irreducible infeasible sets and infeasibility sets are subsets of the set of constraints critical to feasibility. Furthermore, the well-known Bohnenblust–Karlin–Shapley Theorem, which requires that a system of convex inequality constraints must be defined over a compact convex set, is generalized to convex systems without the assumption on compactness of the convex region. Extension of the latter result to convex systems defined over the set of integers is also provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147, 181–210 (1995)
Amaldi, E., Pfetsch, M.E., Trotter, L.E.: On the maximum feasible subsystem problem IISs and IIS-hypergraphs. Math. Program. Ser. A 95, 533–554 (2003)
Chakravarti, N.: Some results concerning post-infeasibility analysis. Eur. J. Oper. Res. 73, 139–143 (1994)
Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157–168 (1991)
Chinneck, J.W.: Analyzing infeasible nonlinear programs. Comput. Optim. Appl. 4, 167–179 (1995)
Chinneck, J.W.: Feasibility and Infeasibility in Optimization, Algorithms and Computational Methods. Springer, Berlin (2008)
Greenberg, H.J.: Consistency, redundancy, and implied equalities in linear systems. Ann. Math. Artif. Intel. 17, 37–83 (1996)
Obuchowska, W.T.: Infeasibility analysis for systems of quadratic convex inequalities. Eur. J. Oper. Res. 107, 633–643 (1998)
Obuchowska, W.T.: On infeasibility of systems of convex analytic inequalities. J. Math. Anal. Appl. 234, 223–245 (1999)
Bonami, P., Cornuéjols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. Ser. A 119, 331–352 (2009)
Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11, 63–77 (1999)
Obuchowska, W.T.: Minimal infeasible constraint sets in convex integer programs. J. Glob. Optim. 46(3), 423–433 (2010)
Obuchowska, W.T.: Feasibility in reverse convex mixed-integer programming. Eur. J. Oper. Res. 218(1), 58–67 (2012)
Obuchowska, W.T.: Feasible partition problem in reverse convex and convex mixed-integer programming. Eur. J. Oper. Res. 235(1), 129–137 (2014)
Li, D., Sun, X.: Nonlinear Integer Programming. Springer, Berlin (2006)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Interscience Series in Discrete Mathematics and Optimization. Wiley, London (1988)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, London (1986)
Bohnenblust, H.F., Karlin, S., Shapley, L.S.: Solutions of discrete, two person games, contributions to the theory of games. Ann. Math. Stud. 1(24), 59–72 (1950)
Mangasarian, O.L.: Nonlinear Programming. Mc Graw-Hill, New York (1969)
Meyer, R.R.: On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Program. 7, 223–235 (1974)
Byrd, R.H., Goldman, A.J., Heller, M.: Recognizing unbounded integer programs. Oper. Res. 35, 140–142 (1987)
Obuchowska, W.T.: On boundedness of (quasi-)convex integer optimization problems. Math. Methods Oper. Res. 68(3), 445–467 (2008)
Obuchowska, W.T.: Unboundedness in reverse convex and concave integer programming. Math. Methods Oper. Res. 72, 187–204 (2010)
Rockafellar, R.T.: Some convex programs whose duals are linearly constrained. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming. Academic Press, New York (1970)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Obuchowska, W.T.: On generalization of the Frank-Wolfe theorem to convex and quasi-convex programmes. Comp. Optim. Appl. 33, 349–364 (2006)
Caron, R.J., Obuchowska, W.T.: An algorithm to determine boundedness of quadratically constrained convex programmes. Eur. J. Oper. Res. 80, 431–438 (1995)
Chinneck, J.W.: Formulating processing networks: viability theory. Nav. Res. Logist. 37, 245–261 (1990)
Chinneck, J.W.: Viability analysis: a formulation aid for all classes of network models. Nav. Res. Logist. 39, 531–543 (1992)
Acknowledgments
The author would like to thank two anonymous referees for their valuable input and suggestions. Particular thanks are due to one of the referees for suggesting an alternative approach to finding implicit equalities in a linear homogeneous system, using an analogy to nonviability identification in network flows.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Richard J. Caron.
Rights and permissions
About this article
Cite this article
Obuchowska, W.T. Irreducible Infeasible Sets in Convex Mixed-Integer Programs. J Optim Theory Appl 166, 747–766 (2015). https://doi.org/10.1007/s10957-015-0720-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0720-1