मराठी

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

प्रश्न

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.

तक्ता
बेरीज

उत्तर

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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Linear Programming - Exercise [पृष्ठ २५३]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 12
पाठ 12 Linear Programming
Exercise | Q 19 | पृष्ठ २५३

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

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


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.


Determine the maximum value of Z = 11x + 7y subject to the constraints : 2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.


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


Refer to question 15. Determine the maximum distance that the man can travel.


The feasible solution for a LPP is shown in Figure. Let Z = 3x – 4y be the objective function. Minimum of Z occurs at ______.


Refer to Question 27. Maximum of Z occurs at ______.


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


Refer to Question 32, Maximum of F – Minimum of F = ______.


In a LPP, the objective function is always ______.


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.


If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax + by may or may not exist.


In a LPP, the minimum value of the objective function Z = ax + by is always 0 if the origin is one of the corner point of the feasible region.


Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum?


In the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:


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 ____________.


In linear programming infeasible solutions


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. If M and m respectively be the largest and smallest values at corner points then ____________.


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 = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.


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×