Advertisements
Advertisements
Question
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
Solution
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
RELATED QUESTIONS
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.
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 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.
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.
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.
Feasible region (shaded) for a LPP is shown in Figure. Maximise Z = 5x + 7y.
Refer to question 13. Solve the linear programming problem and determine the maximum profit to the manufacturer
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.
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 ____________.
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 the given graph, the feasible region for an LPP is shaded. The objective function Z = 2x – 3y will be minimum at:

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 ____________.
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 = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Maximize Z = 10 x1 + 25 x2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.
Which expression has the general form of an objective function with constants \(a\) and \(b\)?
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?
What are the unknown quantities in a Linear Programming Problem called?
