11-09-2017, 12:25 PM
The linear programming models that have been discussed so far have been continuous, in the sense that the decision variables are allowed to be fractional. Often this is a realistic assumption. For example, we could easily produce 1023 4 gallons of a good divisible like wine. It might also be reasonable to accept a solution that would produce hourly car production in 581 2 if the model were based on average hourly output and production had the interpretation of production rates.
An integer programming problem is a mathematical optimization or viability program in which some or all of the variables are restricted to integers. In many contexts the term refers to integer linear programming (ILP), in which the objective function and constraints (other than integer constraints) are linear.
The entire programming is NP-hard. A special case, 0-1 integer linear programming, in which the unknowns are binary, and only the constraints must be satisfied, is one of Karp 21 NP-complete problems.
An integer programming problem is a mathematical optimization or viability program in which some or all of the variables are restricted to integers. In many contexts the term refers to integer linear programming (ILP), in which the objective function and constraints (other than integer constraints) are linear.
The entire programming is NP-hard. A special case, 0-1 integer linear programming, in which the unknowns are binary, and only the constraints must be satisfied, is one of Karp 21 NP-complete problems.