linear programming - union university
TRANSCRIPT
![Page 1: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/1.jpg)
Linear Programming
Jessica Faith Worrell
![Page 2: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/2.jpg)
What is Linear Programming?
• A specialized mathematical decision-making aid used in industry and government
• Helps interpret data and examine the way things work or should work
• Goal is to find optimal solutions to problems
![Page 3: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/3.jpg)
History
• Early 1800s
– Fourier, a French mathematician, formulated the linear programming problem
• 1900s
– Kantorovich, a Russian mathematician, also developed the problem
– Goal was to improve economic planning in the USSR
![Page 4: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/4.jpg)
History
• World War II provided both the urgency and the funds for such research.
• Efficient resource allocation was required for large scale military planning such as fleets of cargo ships and convoys
![Page 5: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/5.jpg)
History
• 1947- George Dantzig along with associates at the US Department of the Air Force developed the simplex method
• 1951- T.C. Koopmans developed a special linear programming solution used to plan the optimal movement of ships back and forth across the Atlantic during the war
• 1975 Nobel Prize in Economic Science
![Page 6: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/6.jpg)
Applications
• Petroleum refineries• Maximize the value of oil inputs subject to
constraints on refinery equipment and gasoline blend requirements
• Find best locations for pipelines
• Find best routes and schedules for tankers
• 5-10% of total computing time
![Page 7: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/7.jpg)
Applications
• Armour Company• Processed cheese spread specifications
• HJ Heinz Company• Shipment schedules between factories and
warehouses
• Agriculture• Minimize cost for cattle feed
![Page 8: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/8.jpg)
Most Common Applications
• Minimize cost while meeting product specifications
• Maximize profit with optimal production processes or products
• Minimize cost in transportation routes
• Determine best schedules for production and sales
![Page 9: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/9.jpg)
Problem
• A company manufactures two types of hand calculators, Model 1 and Model 2. Model 1 takes one hour to manufacture while Model 2 takes four hours. The cost of manufacturing is $30 and $20 for each Model 1 and 2, respectively. The company has 1,600 hours of labor time available and $18,000 in running costs. The profit on each Model 1 is $10 and each Model 2 is $8.
![Page 10: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/10.jpg)
Solution
• Involves analyzing systems of linear equations
• Two methods• Geometric
• Computational
![Page 11: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/11.jpg)
Geometric Solution
• Four inequalities, or constraints, to consider:
• Time constraint
x + 4y < 1,600
• Monetary constraint
30x + 20y < 18,000
• Nonnegativity constraint
x > 0 and y > 0
![Page 12: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/12.jpg)
Feasible Set
• The set of all possible solutions to the family of inequalities
• Size depends on the amount of constraints
![Page 13: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/13.jpg)
Geometric Solution
• Goal is to maximize the profit where
P = 10x + 8y
• Must be a point that lies in the feasible set
![Page 14: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/14.jpg)
Geometric Solution
• Maximum will occur at a vertex of the feasible set.
P = 0 at A (0, 0)
P = 3200 at B (0, 400)
P = 6400 at C (400, 300)
P = 6000 at D (600, 0)
• Maximum profit is $6,400 when 400 Model 1 calculators are produced and 300 Model 2.
![Page 15: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/15.jpg)
Computational Method
• Simplex method developed by Dantzig
• Involves using matrices to systematically check each corner of the feasible set
• Dantzig chose to go along an edge guaranteed to maximize profit
• Must have linear equations
![Page 16: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/16.jpg)
Simplex Method
• Change inequalities to equalities
x + 4y + u = 1600
30x + 20y + v = 18000
• Rewrite profit function
-10x - 8y + f = 0
![Page 17: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/17.jpg)
Simplex Method
• Initial Simplex Tableau:
1 4 1 0 0 1600 u
30 20 0 1 0 18000 v
-10 -8 0 0 1 0 f
x y u v f
• Corresponds to vertex A
• Basic variables
• Nonbasic variables
![Page 18: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/18.jpg)
Simplex Method
• After using elementary row operations to produce a one in place of the pivot, and zeroes in the rest of the column, we get a second matrix
0 10/3 1 -1/30 0 1000 u
1 2/3 0 1/30 0 600 x
0 -4/3 0 1/3 1 6000 f
• Corresponds to vertex D
![Page 19: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/19.jpg)
Simplex Method
• Now, with 10/3 as the pivot, the resulting matrix is as follows:
0 1 3/10 -1/100 0 300 y
1 0 -1/5 6/150 0 400 x
0 0 2/5 24/75 1 6400 f
• Corresponds to the point C
• Final Simplex Tableau
![Page 20: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/20.jpg)
Simplex Method
• The final matrix gives the following equations:
y + 3/10 u - 1/100 v = 300
x - 1/5 u + 6/150v = 400
2/5 u + 24/75 v + f = 6400
where u = 0, v = 0, y = 300, x = 400 and f = 6400.
• Thus, maximum profit is $6400.
![Page 21: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/21.jpg)
Advantages of Simplex Method
• Yields the same answer
• More practical for problems involving more than two variables
• Readily programmable for a computer
![Page 22: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/22.jpg)
Minimization
• Must find the maximum of -f
• Then the minimum is the negative value of that maximum
![Page 23: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/23.jpg)
Possible Outcomes
• Every linear programming problem falls into one of three categories:
• The feasible set is empty.
If constraints are contradictory, such as
x + 2y > 4 and x + 2y < -2
![Page 24: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/24.jpg)
Possible Outcomes
• The cost function is unbounded on the set.
If two vertices of the feasible set satisfy the maximum or minimum, then every point of the line also does.
Leads to flexibility in production schedule.
![Page 25: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/25.jpg)
Possible Outcomes
• The cost has a maximum or a minimum on the feasible set
There is one point that is the optimal solution
• The first two possibilities are uncommon for real problems in economics
![Page 26: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/26.jpg)
Requirements
• Requires linearly proportional relationships
Resources to be consumed by an activity must be linearly proportional to the activity
• All activities must obey a materials balance
Sum of the resource inputs = Sum of product outputs
![Page 27: Linear Programming - Union University](https://reader031.vdocuments.us/reader031/viewer/2022020704/61fb5df42e268c58cd5d5459/html5/thumbnails/27.jpg)
Conclusion
• Linear Programming offers industry a way to inform the decision makers of all the important information and the most favorable decision.
• It is an asset to companies in today’s growing economy.