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.

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
Advertisements

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 Exemplar [English] Class 12
Chapter 12 Linear Programming
Exercise | Q 19 | Page 253

RELATED QUESTIONS

Solve the following Linear Programming Problems graphically:

Maximise Z = 5x + 3y

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


Solve the following Linear Programming Problems graphically:

Minimise Z = x + 2y

subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.


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

Minimise and Maximise Z = 5x + 10 y

subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, 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 farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


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.


If the feasible region for a linear programming problem is bounded, then the objective function Z = ax + by has both a maximum and a minimum value on R.


Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0


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


The feasible region for a LPP is shown in Figure. Find the minimum value of Z = 11x + 7y


The feasible region for a LPP is shown in figure. Evaluate Z = 4x + y at each of the corner points of this region. Find the minimum value of Z, if it exists.


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


Refer to quastion 12. What will be the minimum cost?


Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer


In a LPP, the objective function is always ______.


A corner point of a feasible region is a point in the region which is the ______ of two boundary lines.


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


Maximum value of the objective function Z = ax + by in a LPP always occurs at only one corner point of the feasible region.


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?


Objective function of a linear programming problem is ____________.


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


A linear programming problem is one that is concerned with ____________.


In linear programming infeasible solutions


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 the feasible region is unbounded, m is the minimum value of the objective function.


If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum.


In a LPP, the objective function is always ____________.


Z = 6x + 21 y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at ____________.


The feasible region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.


Which expression has the general form of an objective function with constants \(a\) and \(b\)?


What are constraints in a Linear Programming Problem?


What are restrictions on decision variables called in linear programming?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×