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 = 3x + 4y

subject to the constraints : x + y ≤ 4, x ≥ 0, 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.


Refer to Example 9. How many packets of each food should be used to maximize the amount of vitamin A in the diet? What is the maximum amount of vitamin A in the diet?


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?


A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of one kg food is given below:

Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1

One kg of food X costs Rs 16 and one kg of food Y costs Rs 20. Find the least cost of the mixture which will produce the required diet?

 


An aeroplane can carry a maximum of 200 passengers. A profit of Rs 1000 is made on each executive class ticket and a profit of Rs 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the 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.


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.


The minimum value of the objective function Z = ax + by in a linear programming problem always occurs at only one corner point of the feasible region


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


Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, 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.


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


Maximise Z = x + y subject to x + 4y ≤ 8, 2x + 3y ≤ 12, 3x + y ≤ 9, x ≥ 0, y ≥ 0.


Refer to Question 30. Minimum value of F is ______.


Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at  ______.


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


A linear programming problem is as follows:

Minimize Z = 30x + 50y

Subject to the constraints: 3x + 5y ≥ 15, 2x + 3y ≤ 18, x ≥ 0, y ≥ 0

In the feasible region, the minimum value of Z occurs 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:


In a linear programming problem, the constraints on the decision variables x and y are x − 3y ≥ 0, y ≥ 0, 0 ≤ x ≤ 3. The feasible region:


Objective function of a linear programming problem is ____________.


The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x - 2y ≥ 0, x ≥ 0, y ≥ 0 is ____________.


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


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


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


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


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


What are constraints in a Linear Programming Problem?


Which other constraint must be satisfied together with \[5x+y\leq 100\] in the profit-maximization formulation?


What is the name of the quantity to be optimised in linear programming?


What are restrictions on decision variables called in linear programming?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×