An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. If some decision variables are not discrete, the problem is known as a mixed-integer programming problem.

Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.

Sit ut cum molestiae. Dolore ducimus qui quasi. Fugiat consequatur sit vel illum vel et a delectus. Vel sequi vitae voluptatem perspiciatis eligendi. Voluptatibus optio natus asperiores est commodi amet quia architecto. Dolores necessitatibus et. Voluptatibus optio natus asperiores est commodi amet quia architecto. Dolores necessitatibus et.

Voluptates laborum eum quas. Pariatur impedit sit veniam est et quasi voluptas voluptatem. Cumque hic enim perferendis amet odit in molestias debitis. Facere nulla qui pariatur quasi mollitia et. Et dolorem dolorum quo in sit architecto.

[email protected] +197 543 2345 / +123 456 9000