August 25, 2020
Chapters
Introduction
Optimization of resources (cost and time) is required in every aspect of our lives. We need the optimization because we have limited time and cost resources, and we need to take maximum out of them. From manufacturing to resolving supply chain issues, every aspect of the business world today requires optimization to stay competitive.
Linear programming offers the most easiest way to do optimization as it simplifies the constraints and helps to reach a viable solution to a complex problem. In this article, we will solve some of the linear programming problems through graphing method.
Exercise 1
A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated capacity of and a non-refrigerated capacity of
while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of
of refrigerated stock and
of non-refrigerated stock. The cost per kilometer of a Type A is $30, and $40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost?
Exercise 2
A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9 drivers available. The rental cost for a large bus is $800 and $600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost.
Exercise 3
A store wants to liquidate 200 of its shirts and 100 pairs of pants from last season. They have decided to put together two offers, A and B. Offer A is a package of one shirt and a pair of pants which will sell for $30. Offer B is a package of three shirts and a pair of pants, which will sell for $50. The store does not want to sell less than 20 packages of Offer A and less than 10 of Offer B. How many packages of each do they have to sell to maximize the money generated from the promotion?
Solution of exercise 1
A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated capacity of and a non-refrigerated capacity of
while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of
of refrigerated stock and
of non-refrigerated stock. The cost per kilometer of a Type A is $30, and $40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost?
a) Choose the unknowns.
x = Type A trucks
y = Type B trucks
b) Write the objective function.
c) Write the constraints as a system of inequalities.
d) Find the set of feasible solutions that graphically represent the constraints.
e) Calculate the coordinates of the vertices from the compound of feasible solutions.
f) Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.
As x and y must be natural numbers round the value of y.
By default, we see what takes the value x to y = 66 in the equation which it is within the feasible solutions.
The minimum cost is $4170. To achieve this 51 trucks of Type A and 66 trucks of Type B are needed.
Solution of exercise 2
A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9 drivers available. The rental cost for a large bus is $800 and $600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost.
a)Choose the unknowns.
x = small buses
y = big buses
b) Write the objective function.
c) Write the constraints as a system of inequalities.
d) Find the set of feasible solutions that graphically represent the constraints.
e) Calculate the coordinates of the vertices from the compound of feasible solutions.
f) Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.
Hence, the minimum cost is $6200. This is achieved with 4 large and 5 small buses.
We substituted the points (0,9), (0,8), and (5,4) in the equation to determine the minimum cost. However, you can tell this by directly looking at the graph. The coordinate (5,4) comes under the feasible region and is the minimum point of it.
Solution of exercise 3
A store wants to liquidate 200 of its shirts and 100 pairs of pants from last season. They have decided to put together two offers, A and B. Offer A is a package of one shirt and a pair of pants which will sell for $30. Offer B is a package of three shirts and a pair of pants, which will sell for $50. The store does not want to sell less than 20 packages of Offer A and less than 10 of Offer B. How many packages of each do they have to sell to maximize the money generated from the promotion?
a) Choose the unknowns.
x = number of packages of Offer A
y = number of packages of Offer B
b) Write the objective function.
c) Write the constraints as a system of inequalities.
d) Find the set of feasible solutions that graphically represent the constraints.
e) Calculate the coordinates of the vertices from the compound of feasible solutions.
f) Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.
50 packages of each offer generates a maximum amount of $4000 in sales.
I think in the exercise 2, instead of x+y<=9 it should be 10x+8y<=9, as there are 10 big and 8 small buses but only 9 drivers available for them.
Who can help me solve the question below
100 per goat.How many cow and goat should be varse for maximum profit.(linear programming)
A farmer has 500acres of land kept for grazing by some animals.The estimate that one cow requires five acres and one goat requires 4 acres.The farmer has the facilities for 40 cows and 100 goats.if the farmer makes