Linear Programming
Get insights from 59 questions on Linear Programming, answered by students, alumni, and experts. You may also ask and answer any question you like about Linear Programming
- 59
Questions
- 0
Discussions
- 0
Active Users
- 0
Followers
Have a question about Linear Programming? Ask our experts
Keep it short & simple. Type complete word. Avoid abusive language.
14. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1 hour on machine B to produce a package of bolts. He earns a profit of ?. 17.50 per package on nuts and ?. 7.00 per package on bolts. How many packages of each should be produced each day so as to maximize his profit, if he operates his machines for at the most 12 hours a day?
14. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on machine B to produce a package of nuts. It takes 3 hours on machine A and 1 hour on machine B to produce a package of bolts. He earns a profit of ?. 17.50 per package on nuts and ?. 7.00 per package on bolts. How many packages of each should be produced each day so as to maximize his profit, if he operates his machines for at the most 12 hours a day?
Let the manufacturer produce x packages of nuts and y packages of bolts. Therefore,
x ≥ 0 and y ≥ 0
The given information can be compiled in a table as follows.
| Nuts | Bolts | Availability |
Machine A (h) | 1 | 3 | 12 |
Machine B (h) | 3 | 1 | 12 |
The profit on a package of nuts is Rs 17.50 and on a package of bolts is Rs 7. Therefore, the constraints a
13. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman’s time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman’s time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman’s time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs. 20 and Rs. 10 respectively, find maximum profit of the factory when it works at full capacity.
13. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman’s time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman’s time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman’s time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs. 20 and Rs. 10 respectively, find maximum profit of the factory when it works at full capacity.
(i) Let the number of rackets and the number of bats to be made be x and y respectively.
The machine time is not available for more than 42 hours.
The craftsman’s time is not available for more than 24 hours.
The factory is to work at full capacity. Therefore,
On solving these equati
12. One kind of cake requires 200g of flour and 25 g of fat and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cake which can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.
12. One kind of cake requires 200g of flour and 25 g of fat and another kind of cake requires 100 g of flour and 50 g of fat. Find the maximum number of cake which can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.
Let there be x cakes of first kind and y cakes of second kind. Therefore,
x ≥ 0 and y ≥ 0
The given information can be complied in a table as follows.
| Flour (g) | Fat (g) |
Cakes of first kind, x | 200 | 25 |
Cakes of second kind, y | 100 | 50 |
Availability | 5000 | 1000 |
Total numbers of cakes, Z, that can be made are,
The mathematical formulation of the given problem is
Maximize&nb
11. Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B. Food P costs ?. 60/kg and Food Q costs ?. 80/kg. Food P contains 3 units/kg of vitamin A and 5 units/kg of vitamin B while Food Q contains 4 units/kg of vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.
11. Reshma wishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 11 units of vitamin B. Food P costs ?. 60/kg and Food Q costs ?. 80/kg. Food P contains 3 units/kg of vitamin A and 5 units/kg of vitamin B while Food Q contains 4 units/kg of vitamin A and 2 units/kg of vitamin B. Determine the minimum cost of the mixture.
Let the mixture contain x kg of food P and y kg of food Q. Therefore, x ≥ 0 and y ≥ 0
The given information can be compiled in a table as follows.
| Vitamin A (units/kg) | Vitamin B (units/kg) | Cost (Rs/kg) |
Food P | 3 | 5 | 60 |
Food Q | 4 | 2 | 80 |
Requirement (units/kg) | 8 | 11 |
|
The mixture must contain at least 8 units of vitamin A and 11 units of vitamin B. Therefore, the constraints are
Total cost, Z, of purchasing
10. Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.
10. Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.
Maximise , subject to
The corresponding equation of the given inequalities are
The graph of the given inequalities is shown.

There is no common point in the two shaded region. Thus, there is no feasible region.
Z has no maximum value.
9. Maximise Z = – x + 2y, subject to the constraints x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
9. Maximise Z = – x + 2y, subject to the constraints x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Maximise , subject to the constraints
The corresponding equation of the given inequalities are
The graph of the given inequalities is shown

The feasible region unbounded.
The values of Z at corner points A (6,0), B (4,1), and C (3,2) are as follows

As the feasible regio
8. Minimise and Maximise Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
8. Minimise and Maximise Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
Minimize and Maximise
Subject to
The corresponding equation of the given inequalities are
The graph of the inequalities is shown below.

The shaded bounded region ABCD is the feasible region with the corner points.
A (0,50), B, (20,40), C (50,100), D (0,200)
The values o
7. Minimise and Maximise Z = 5x + 10 y subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
7. Minimise and Maximise Z = 5x + 10 y subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Minimize and Maximise
Subject to
The corresponding equation of the given inequalities are
The graph of the inequalities in shown.

The shaded founded region ABCD is the feasible region with the corner points
The value of Z a these corner points are

The minimum value of Z is 300 at (60,0)
6. Minimise Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
6. Minimise Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Minimize
Subject to
The corresponding equation of the given inequalities are

The feasible region is unbounded the corner point are A (6,0), B (0,3)
The value of Z at these corner points are follows.

Since, the feasible region is unbounded, a graph of is drawn.
Also since there is no
5. Maximise Z = 3x + 2y subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
5. Maximise Z = 3x + 2y subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
Maximum
Subject to
The corresponding equation of the given inequalities are :
The graph of the given inequalities

The shaded bounded region OABC in the feasible region with the corner points
The value of Z at these points are given below.

Therefore, the maximum value of Z is 18 at point (4,3).