English

Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit. - Mathematics

Advertisements
Advertisements

Question

Refer to question 14. How many sweaters of each type should the company make in a day to get a maximum profit? What is the maximum profit.

Chart
Sum

Solution

Referring to the solution of Question No.14,

We have Maximise Z = 200x + 120y

Subject to the constraints

x + y ≤ 300  ......(i)

3x + y ≤ 600  ......(ii)

x – y ≥ – 100  ......(iii)

x ≥ 0, y ≥ 0

On solving equation (i) and (iii)

We have x = 100, y = 200

On solving eq. (i) and (ii)

We get x = 150, y = 150

Let x + y = 300

x 0 300
y 300 0

Let 3x + y = 600

x 0 200
y 600 0

Let x + y = –100

x 0 –100
y 100 0


Here, the shaded region is the feasible region whose corner points are O(0, 0), A(200, 0), B(150, 150), C(100, 200), D(0, 100).

Let us evaluate the value of Z.

Corner points Value of Z = 200x + 120y  
O(0, 0) Z = 200(0) + 120(0) = 0  
A(200,0) Z = 200(200) + 120(0) = 40000  
B(150, 150) Z = 200(150) + 120(150) = 48000 ← Maximum
C(100, 200) Z = 200(100) + 120(200) = 44000  
D(0, 100) Z = 200(0) + 120(100) = 12000  

Hence, the maximum value of Z is 48000 at (150, 150)

i.e., 150 sweaters of each type.

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Linear Programming - Exercise [Page 253]

APPEARS IN

NCERT Exemplar Mathematics [English] Class 12
Chapter 12 Linear Programming
Exercise | Q 19 | Page 253

RELATED QUESTIONS

Two tailors, A and B, earn Rs 300 and Rs 400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP


Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Maximise Z = 3x + 2y

subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.


Show that the minimum of Z occurs at more than two points.

Minimise and Maximise Z = x + 2y 

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.


A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:

Type of toy Machines
I II III
A 12 18 6
B 6 0 9

Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs 7.50 and that on each toy of type B is Rs 5, show that 15 toys of type A and 30 of type B should be manufactured in a day to get maximum profit.

 


To maintain his health a person must fulfil certain minimum daily requirements for several kinds of nutrients. Assuming that there are only three kinds of nutrients-calcium, protein and calories and the person's diet consists of only two food items, I and II, whose price and nutrient contents are shown in the table below:
 

  Food I
(per lb)
  Food II
(per lb)
    Minimum daily requirement
for the nutrient
 Calcium 10   5     20
Protein 5   4     20
 Calories 2   6     13
 Price (Rs) 60   100      


What combination of two food items will satisfy the daily requirement and entail the least cost? Formulate this as a LPP.


Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.


Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0


Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.


Refer to Exercise 7 above. Find the maximum value of Z.


In figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y.


Refer to Question 27. (Maximum value of Z + Minimum value of Z) is equal to ______.


The feasible region for an LPP is shown in the figure. Let F = 3x – 4y be the objective function. Maximum value of F is ______.


In a LPP, the linear inequalities or restrictions on the variables are called ____________.


In a LPP if the objective function Z = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ______ value.


The feasible region for an LPP is always a ______ polygon.


For an objective function Z = ax + by, where a, b > 0; the corner points of the feasible region determined by a set of constraints (linear inequalities) are (0, 20), (10, 10), (30, 30) and (0, 40). The condition on a and b such that the maximum Z occurs at both the points (30, 30) and (0, 40) is:


Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


A maximum or a minimum may not exist for a linear programming problem if ____________.


In Corner point method for solving a linear programming problem, one finds the feasible region of the linear programming problem, determines its corner points, and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if ____________.


Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.


Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.


Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.


The feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4x + 3y occurs at the point.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×