मराठी

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

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 Exemplar [English] Class 12
पाठ 12 Linear Programming
Exercise | Q 22 | पृष्ठ २५३

व्हिडिओ ट्यूटोरियलVIEW ALL [2]

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

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:

Minimise Z = – 3x + 4 y

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


Solve the following Linear Programming Problems graphically:

Minimise Z = 3x + 5y

such that x + 3y ≥ 3, x + y ≥ 2, x, 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.


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?


A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?

It is being given that at least one of each must be produced.


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.


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


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


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.


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.


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


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 feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.


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


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.


In a LPP, the maximum value of the objective function Z = ax + by is always finite.


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:


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


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


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


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


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 condition represents non-negative restrictions for two decision variables?


Which statement defines an Optimisation Problem?


Which inequality is one of the given resource constraints in the formulation with objective function \[Z=250x+75y\]?


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


Linear Programming is a method of optimisation under which type of constraints?


What are the unknown quantities in a Linear Programming Problem called?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×