Question: Graph a 2-variable integer feasible region. Here are the decision variables and constraints of an integer linear optimization model: x1, x2 are integer x1 -
Graph a 2-variable integer feasible region.
Here are the decision variables and constraints of an integer linear optimization model:
x1, x2 are integer x1 - x2 -1.5 x1 1 x1 3 x1, x2 0 i) How many feasible decision points are there? ii) If the objective function is to maximize x1, then how many optimal decision points are there?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
