Lecture 8 Linear Programming
Lecture 8 Linear Programming
Minimization Maximization ≤ ≥ =
− 𝒏𝒐𝒕 𝒎𝒐𝒓𝒆 𝒕𝒉𝒂𝒏 - Not less than exactly
- at most - at least
- max. limit - Min. Limit
Solving Methods of Linear Programming
Objective Constraints
3𝑥1 + 6𝑥2 ≤ 36
𝑥1, 𝑥2 ≥ 0
Solution by Graphic Solution
• 𝑥1 + 𝑥2 ≤ 10
At x1=0 then x2 =10
At x2=0 then x1=10
• 3𝑥1 + 6𝑥2 ≤ 36
• At x1 = 0 then x2 = 6
• At x2 = 0 then x1 = 12
• POINT (10, 0), (8, 2), (0, 6), (0, 0)
• Z@(10, 0) = 30
• Z@(8, 2) = 32
• Z@(0, 6) = 24
• Z@(0, 0) = 0
• Then the maximum value at x1=8 and x2=2
And the objective function value is 32 unit
Application
• A company produces two products: x and y . The raw material
requirements, space needed for storage, production rates, and selling
prices for these products are given in Table 1.
Table 1 Production Data
Product
x y
Storage Space (m2/unit) 3 3
Raw material (kg/unit) 5 7
Production rate (min/unit) 2 1
Selling price ($/unit) 12 10
The total storage space for all products is 750 m2 , The total amount of raw
material available per day for both products is 1596 kg., and a maximum
of production time 400 Min. per day. Determine Optimal production
planning
Solution
• Max z = 12 x + 10 y
Subject to
3𝑥 + 3𝑦 ≤ 750
5𝑥 + 7𝑦 ≤ 1596
2𝑥 + 1𝑦 ≤ 400
𝑥, 𝑦 ≥ 0
Find the optimal solution by graphic method
Draw First Constraint
Draw Second Constraint
Draw Third Constraint
Determine the intersection points