Scribd
Upload
15 views

Method. The Method Comprises of The Following Steps:: Example 1

Uploaded by

poonamkhoradiya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Method. The Method Comprises of The Following Steps:: Example 1

Uploaded by

poonamkhoradiya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

LINEAR PROGRAMMING 399

We observe that the maximum profit to the dealer results from the investment
strategy (10, 50), i.e. buying 10 tables and 50 chairs.
This method of solving linear programming problem is referred as Corner Point
Method. The method comprises of the following steps:
1. Find the feasible region of the linear programming problem and determine its
corner points (vertices) either by inspection or by solving the two equations of
the lines intersecting at that point.
2. Evaluate the objective function Z = ax + by at each corner point. Let M and m,
respectively denote the largest and smallest values of these points.
3. (i) When the feasible region is bounded, M and m are the maximum and
minimum values of Z.
(ii) In case, the feasible region is unbounded, we have:
4. (a) M is the maximum value of Z, if the open half plane determined by
ax + by > M has no point in common with the feasible region. Otherwise, Z
has no maximum value.
(b) Similarly, m is the minimum value of Z, if the open half plane determined by
ax + by < m has no point in common with the feasible region. Otherwise, Z
has no minimum value.
We will now illustrate these steps of Corner Point Method by considering some
examples:
Example 1 Solve the following linear programming problem graphically:
Maximise Z = 4x + y ... (1)
subject to the constraints:
x + y ≤ 50 ... (2)
3x + y ≤ 90 ... (3)
x ≥ 0, y ≥ 0 ... (4)
Solution The shaded region in Fig 12.2 is the feasible region determined by the system
of constraints (2) to (4). We observe that the feasible region OABC is bounded. So,
we now use Corner Point Method to determine the maximum value of Z.
The coordinates of the corner points O, A, B and C are (0, 0), (30, 0), (20, 30) and
(0, 50) respectively. Now we evaluate Z at each corner point.

Reprint 2024-25
400 MATHEMATICS

Corner Point Corresponding value


of Z
(0, 0) 0
(30, 0) 120 ← Maximum
(20, 30) 110
(0, 50) 50

Fig 12.2
Hence, maximum value of Z is 120 at the point (30, 0).
Example 2 Solve the following linear programming problem graphically:
Minimise Z = 200 x + 500 y ... (1)
subject to the constraints:
x + 2y ≥ 10 ... (2)
3x + 4y ≤ 24 ... (3)
x ≥ 0, y ≥ 0 ... (4)
Solution The shaded region in Fig 12.3 is the feasible region ABC determined by the
system of constraints (2) to (4), which is bounded. The coordinates of corner points

Corner Point Corresponding value


of Z
(0, 5) 2500
(4, 3) 2300 ← Minimum
(0, 6) 3000

Fig 12.3

Reprint 2024-25

You might also like