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.
APPEARS IN
संबंधित प्रश्न
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:
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.
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 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.
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
Maximise Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0
Determine the maximum value of Z = 3x + 4y if the feasible region (shaded) for a LPP is shown in Figure
A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs 120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem
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.
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 ______.
In a LPP, the objective function is always ______.
If the feasible region for a LPP is ______ then the optimal value of the objective function Z = ax + by may or may not exist.
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.
A feasible region of a system of linear inequalities is said to be ______ if it can be enclosed within a circle.
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.
In a LPP, the maximum value of the objective function Z = ax + by is always finite.
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 ____________.
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 ____________.
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, optimal solution ____________.
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.
Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
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 figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at ____________.

In the expression \[Z=250x+75y\], which quantities are the decision variables?
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?
Which set gives the complete non-negative restrictions for the profit-maximization formulation?
Linear Programming is a method of optimisation under which type of constraints?
