

O (0, 0), A (4, 0), and B (0, 4) are the corner points of the feasible region. The values of Z at these points are given below.
| Corner point | Z = 3x + 4y | |
| O (0, 0) | 0 | |
| A (4, 0) | 12 | |
| B (0, 4) | 16 | Maximum |
O (0, 0), A (4, 0), B (2, 3) and C (0, 4) are the corner points of the feasible region.
The values of Z at these corner points are given below.
| Corner point | Z = – 3x + 4y | |
| O (0, 0) | 0 | |
| A (4, 0) | -12 | Minimum |
| B (2, 3) | 6 | |
| C (0, 4) | 16 |
O (0, 0), A (2, 0), B (0, 3) and C (20 / 19, 45 / 19) are the corner points of the feasible region. The values of Z at these corner points are given below.
| Corner point | Z = 5x + 3y | |
| O (0, 0) | 0 | |
| A (2, 0) | 10 | |
| B (0, 3) | 9 | |
| C (20 / 19, 45 / 19) | 235 / 19 | Maximum |
It can be seen that the feasible region is unbounded.
The corner points of the feasible region are A (3, 0), B (3 / 2, 1 / 2) and C (0, 2).
The values of Z at these corner points are given below.
| Corner point | Z = 3x + 5y | |
| A (3, 0) | 9 | |
| B (3 / 2, 1 / 2) | 7 | Smallest |
| C (0, 2) | 10 |
Solution:
The feasible region determined by the constraints,
x
+ 2
y
≤ 10, 3
x
+
y
≤ 15,
x
≥ 0, and
y
≥ 0, is given below.
A (5, 0), B (4, 3), C (0, 5) and D (0, 0) are the corner points of the feasible region.
The values of Z at these corner points are given below.
| Corner point | Z = 3x + 2y | |
| A (5, 0) | 15 | |
| B (4, 3) | 18 | Maximum |
| C (0, 5) | 10 |
A (6, 0) and B (0, 3) are the corner points of the feasible region.
The values of Z at the corner points are given below.
| Corner point | Z = x + 2y |
| A (6, 0) | 6 |
| B (0, 3) | 6 |
A (60, 0), B (120, 0), C (60, 30), and D (40, 20) are the corner points of the feasible region. The values of Z at these corner points are given below.
| Corner point | Z = 5x + 10y | |
| A (60, 0) | 300 | Minimum |
| B (120, 0) | 600 | Maximum |
| C (60, 30) | 600 | Maximum |
| D (40, 20) | 400 |
A (0, 50), B (20, 40), C (50, 100) and D (0, 200) are the corner points of the feasible region. The values of Z at these corner points are given below.
| Corner point | Z = x + 2y | |
| A (0, 50) | 100 | Minimum |
| B (20, 40) | 100 | Minimum |
| C (50, 100) | 250 | |
| D (0, 200) | 400 | Maximum |
Solution:
The feasible region determined by the constraints,
Here, it can be seen that the feasible region is unbounded.
The values of Z at corner points A (6, 0), B (4, 1) and C (3, 2) are given below.
| Corner point | Z = – x + 2y |
| A (6, 0) | Z = – 6 |
| B (4, 1) | Z = – 2 |
| C (3, 2) | Z = 1 |
Solution:
The region determined by the constraints
There is no feasible region, and therefore, z has no maximum value.
| Vitamin A (units/kg) | Vitamin B (units/kg | Cost (Rs/kg) | |
| Food P | 3 | 5 | 60 |
| Food Q | 4 | 2 | 80 |
| Requirement (units/kg) | 8 | 11 |
Clearly, we can see that the feasible region is unbounded.
A (8 / 3, 0), B (2, 1 / 2) and C (0, 11 / 2)
The values of Z at these corner points are given below.
| Corner point | Z = 60x + 80 y | |
| A (8 / 3, 0) | 160 | Minimum |
| B (2, 1 / 2) | 160 | Minimum |
| C (0, 11 / 2) | 440 |
| Flour (g) | Fat (g) | |
| Cakes of the first kind, x | 200 | 25 |
| Cakes of the second kind, y | 100 | 50 |
| Availability | 5000 | 1000 |
A (25, 0), B (20, 10), O (0, 0) and C (0, 20) are the corner points.
The values of Z at these corner points are as given below.
| Corner point | Z = x + y | |
| A (25, 0) | 25 | |
| B (20, 10) | 30 | Maximum |
| C (0, 20) | 20 | |
| O (0,0) | 0 |
12.1 Introduction
12.2 Linear Programming Problem and its Mathematical Formulation12.2.1 Mathematical formulation of the problem
12.2.2 Graphical method of solving linear programming problems
12.3 Different Types of Linear Programming Problems12.3.1 Manufacturing problems
12.3.2 Diet problems
12.3.3 Transportation problems
