Unbounded problem

When the feasible region is unbounded and if we draw the objective function and it is parallel to
itself without bound then the problem is called unbounded problem

Let the inequality and constraints are

Max z= 3x1 + 4x2

Subject to x1 + x2 >= 5

3x1 + x2 >= 8

Where x1 and x2 >= 0

If no point satisfies both the constraints then it has no feasible region and so no optimal solution.

Max z= 2x1 + 6x2

Subject to 4x1 + 3x2 <= 12

2x1 + x2 >= 8

X1, x2>= 0
If the constraints are removed and still the feasible region is not affected then the constraints are
called redundant constraints

Max z= x1 + 2x2

Subject to x1+ x2 <= 20

2x1 + x2 <= 30

X1, x2 >= 0

Here x <= 25 is a redundant constraints.