3364-3-2E

AID: 1825 | 17/06/2016

Write the objective function to be optimized;

Minimize: Z 2 x1 13 x2
Here, x1 and x2 are the decision variables.
The graph of the objective function depends upon the assumption of decision variables.
Write the first constraint equation;
x1 2 x2 8

(1)

Substitute 0 for x1 .
0 2 x2 8
x2 4
Hence, first set of decision variables satisfying the constraint equation is (0,4).
Substitute 0 for x2 .
x1 2 0 8
x1 8
Hence, second set of decision variables satisfying the constraint equation is (-8,0).
The values above the graph line of constraint equation represent the feasible region for
Equation (1).
Write the second constraint equation;
2 x1 2 x2 16

(2)

Substitute 0 for x1 .
2 0 2 x2 16
x2 8
Hence, first set of decision variables satisfying the constraint equation is (0,8).
Substitute 0 for x2 .
2 x1 2 0 16
x1 8
Hence, second set of decision variables satisfying the constraint equation is (8,0).
The values below the graph line of constraint equation represent the feasible region for
Equation (2).
Write the third constraint equation;
3 x1 9

(3)

Solve Equation (3).

3 x1 9
x1 3
Hence, first set of decision variables satisfying the constraint equation is (3,0).
The values right of the graph line of constraint equation represents the feasible region for
Equation (3).
Write the fourth constraint equation;
2 x2 6

(4)

Solve Equation (4).

2 x2 6
x2 3
Hence, first set of decision variables satisfying the constraint equation is (0,3).
The values above the graph line of constraint equation represent the feasible region for
Equation (4).

Plot the graph for each constraint equation using the values of decision variables as
shown in Figure (1).

The graph shows the feasible space for each constraint. There is no common feasible
space that satisfies all the constraints.
Therefore, there is no decision variable and hence there is no optimal solution.
Therefore, this linear program is infeasible .