Scribd
Upload
53 views15 pages

Lecture 8 Linear Programming

This document discusses linear programming and provides an example problem. It introduces the key components of a linear programming problem: the objective function to maximize or minimize, subject to various constraints that are less than, greater than, or equal to certain values. It presents both a graphic and simplex method for solving linear programming problems. The example problem provided seeks to maximize profit based on production of two products with constraints on storage space, raw materials, and production time. The optimal solution is found using the graphic method and maximizes profit by producing a certain number of units of each product.

Uploaded by

Mohamed Khalil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views15 pages

Lecture 8 Linear Programming

This document discusses linear programming and provides an example problem. It introduces the key components of a linear programming problem: the objective function to maximize or minimize, subject to various constraints that are less than, greater than, or equal to certain values. It presents both a graphic and simplex method for solving linear programming problems. The example problem provided seeks to maximize profit based on production of two products with constraints on storage space, raw materials, and production time. The optimal solution is found using the graphic method and maximizes profit by producing a certain number of units of each product.

Uploaded by

Mohamed Khalil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Fourth Year of Engineering

MEC 486: Project Planning


Linear Programming
Prof. Mohamed Ibrahim
LINEAR PROGRAMMING Model

Objective Function Constraints

Minimization Maximization ≤ ≥ =
− 𝒏𝒐𝒕 𝒎𝒐𝒓𝒆 𝒕𝒉𝒂𝒏 - Not less than exactly
- at most - at least
- max. limit - Min. Limit
Solving Methods of Linear Programming

Graphical Method Simplex Method


Example

Objective Constraints

max 𝑍 = 3𝑥1 + 4𝑥2 𝑥1 + 𝑥2 ≤ 10

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

The coordinates Z Value


point 1 (200, 0) 2400
Point 2 (150, 100) 2800
point 3 (77, 173) 2654
point 4 (0, 228) 2280
point 5 (0, 0) 0
Assignment: Manufacturing problem
• A manufacturing company makes two models A and B of a
product. Each piece of Model A requires 9 labor hours for
fabricating and 1 labor hour for finishing. Each piece of Model
B requires 12 labor hours for fabricating and 3 labor hours for
finishing. For fabricating and finishing, the maximum labor
hours available are 180 and 30 respectively. The company
makes a profit of $ 80 on each piece of model A and $ 120 on
each piece of Model B. How many pieces of Model A and
Model B should be manufactured per week to realize a
maximum profit? What is the maximum profit per week?
Thank You

You might also like