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

Solve the following linear programming problems by graphical method. Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0. - Business Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Solve the following linear programming problems by graphical method.

Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0.

आलेख
Advertisements

उत्तर

Given that 30x1 + 20x2 ≤ 300

Let 30x1 + 20x2 = 300

Therefore 3x1 + 2x2 = 30

x1 0 10
x2 15 0

Also given that 5x1 + 10x2 ≤ 110

Let 5x1 + 10x2 = 110

x1 + 2x2 = 22

x1 0 22
x2 11 0

To get point of intersection, (i.e., the to get co-ordinates of B)

3x1 + 2x2 = 30 …….(1)

x1 + 2x2 = 22 ……..(2)

2x1 = 8 ......[Equation (1) – (2)]

x1 = 4

x1 = 4 substitute in (1),

x1 + 2x2 = 22

4 + 2x2 = 22

2x2 = 18

x2 = 9

i.e., B is (4, 9)

The feasible region satisfying all the given conditions is OABC.

The co-ordinates of the points are O(0, 0), A(10, 0), B(4, 9), C(0, 11).

Corner points Z = 6x1 + 8x2
O(0, 0) 0
A(10, 0) 60
B(4, 9) 6 × 4 + 8 × 9 = 96
C(0, 11) 88

The maximum value of Z occurs at B(4, 9).

∴ The optimal solution is x1 = 4, x2 = 9 and Zmax = 96

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

APPEARS IN

सामाचीर कलवी Business Mathematics and Statistics [English] Class 11 TN Board
पाठ 10 Operations Research
Exercise 10.1 | Q 4. (i) | पृष्ठ २४४

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

Find the feasible solution of the following inequation:

2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0


A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.


Solve the following L.P.P. by graphical method:

Minimize: z = 8x + 10y

Subject to: 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.


The maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.


Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.


The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.


If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.


A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:

Raw Material\Fertilizers F1 F2 Availability
A 2 3 40
B 1 4 70

By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as L.P.P. to maximize the profit.


State whether the following is True or False :

Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.


The values of θ satisfying sin7θ = sin4θ - sinθ and 0 < θ < `pi/2` are ______


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×