Question

How to solve mixed integer linear programming?

Answer 1

${\huge{\mathcal{\purple{ANSWER :- }}}}$

A mixed-integer programming (MIP) problem is one where some of the decision variables are constrained to be integer values (i.e. whole numbers such as -1, 0, 1, 2, etc.) at the optimal solution. The use of integer variables greatly expands the scope of useful optimization problems that you can define and solve.