मराठी

A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available pe - Mathematics

Advertisements
Advertisements

प्रश्न

A manufacturer produces two Models of bikes-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

तक्ता
बेरीज
Advertisements

उत्तर

Let x and y be the number of Models of bike produced by the manufacturer.

Given information is

Model X takes 6 man-hours to make per unit

Model Y takes 10 man-hours to make per unit

Total man-hours available = 450

∴ 6x + 10y ≤ 450

⇒ 3x + 5y ≤ 225  ......(i)

Handling and marketing cost of Model X and Y are ₹ 2,000 and ₹ 1,000 respectively

Total funds available is ₹ 80,000 per week

∴ 2000x + 1000y ≤ 80,000

⇒ 2x + y ≤ 80   ......(ii)

And x ≥ 80, y ≥ 0

Profit (Z) per unit of models X and Y are ₹ 1,000 and ₹ 500 respectively

So, Z = 1000x + 500y

The required LPP is

Maximise Z = 1000x + 500y subject to the constraints

3x + 5y ≤ 225  .......(i)

x 0 75
y 45 0

2x + y ≤ 80  ......(ii)

x 0 40
y 80 0

x ≥ 0, y ≥ 0  ......(iii)

On solving equation (i) and (ii)

We get, x = 25, y = 30

Here, the feasible region is OABC

Whose corner points are O(0, 0), A(40, 0), B(25, 30) and C(0, 45).

Let us evaluate the value of Z.

Corner points Value of Z = 1000x + 500y  
O(0, 0) Z = 0 + 0 = 0  
A(40, 0) Z = 1000(40) + 0 = 40,000 ← Maximum
B(25, 30) Z = 1000(25) + 500(30) = 40,000 ← Maximum
C(0, 45) Z = 0 + 500(45) = 22500  

Hence, the maximum profit is ₹ 40,000 by producing 25 bikes of Model X and 30 bikes of Model Y.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Linear Programming - Exercise [पृष्ठ २५३]

APPEARS IN

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

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

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:

Minimise Z = – 3x + 4 y

subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problems graphically:

Maximise Z = 5x + 3y

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


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

Maximise Z = – x + 2y, Subject to the constraints:

x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, 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?


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.


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


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


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


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


A company makes 3 model of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimise the operating costs and still meet the demand.


The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y ______.

Compare the quantity in Column A and Column B

Column A Column B
Maximum of Z 325

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


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


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


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


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


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.


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 maximum value of the objective function Z = ax + by is always finite.


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:


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:


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


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


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.


In a LPP, the objective function is always ____________.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×