proof MIP is NP hard
proof MIP is NP hard
https://or.stackexchange.com/questions/3027/milp-is-it-np-complete-or-np-hard
A very good discussion of the complexity of MILP is given in the paper1 and the reference within2. Based on the discussion in section 3.2
MILP is NP-hard.
(1) Bulut, Aykut, and Ted K. Ralphs. On the complexity of inverse mixed integer linear optimization. Tech. rep. COR@ L Laboratory Report 15T-001-R3, Lehigh University, 2015 (cit. on p. 147).
(2) Papadimitriou, Christos H., and Mihalis Yannakakis. “The complexity of facets (and some facets of complexity).” Journal of Computer and System Sciences 28.2 (1984): 244-259.
