मराठी
तामिळनाडू बोर्ड ऑफ सेकेंडरी एज्युकेशनएचएससी वाणिज्य इयत्ता ११

Solve the following linear programming problem graphically. Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0. - Business Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following linear programming problem graphically.

Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, x2 ≥ 0.

बेरीज
Advertisements

उत्तर

Since the decision variables, x1 and x2 are non-negative, the solution lies in the I quadrant of the plane.

Consider the equations

x1 + x2 = 6

x1 0 6
x2 6 0

x1 = 4 is a line parallel to x2-axis at a distance of 4 units.

x2 = 5 is a line parallel to x1-axis at a distance of 5 units.

The feasible region is OABCD and its co-ordinates are O(0, 0) A(4, 0) D(5, 0) and B is the point of intersection of the lines x1 + x2 = 6 and x1 = 4 

Also C is the point of intersection of the lines x1 + x2 = 6 and x2 = 5

Verification of B:

x1 + x2 = 6 and x1 = 4

4 + x2 = 6

x2 = 2

∴ B is (4, 2)

Verification of C:

x1 + x2 = 6 and x2 = 5

x1 + 5 = 6

x1 = 1

∴ C is (1, 5)

Corner points Z = 3x1 + 5x2
O(0, 0) 0
A(4, 0) 12
B(4, 2) 22
C(1, 5) 26
D(5, 0) 15

Maximum of Z occurs at C(1, 5)

∴ The solution is x1 = 1, x2 = 5 and Zmax = 26.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 10: Operations Research - Miscellaneous Problems [पृष्ठ २५२]

APPEARS IN

सामाचीर कलवी Business Mathematics and Statistics [English] Class 11 TN Board
पाठ 10 Operations Research
Miscellaneous Problems | Q 5 | पृष्ठ २५२

संबंधित प्रश्‍न

Find the feasible solution of the following inequation:

3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.


Solve the following LPP by graphical method:

Maximize z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.


Which of the following is correct?


The half-plane represented by 3x + 2y < 8 contains the point ______.


A firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each units of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufactured per month to maximize profit? How much is the maximum profit?


Choose the correct alternative :

The half plane represented by 3x + 2y ≤ 0 constraints the point.


State whether the following is True or False :

The feasible solution of LPP belongs to only quadrant I.


The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is:


A firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.


The set of feasible solutions of LPP is a ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×