❑ Introduction.

❑ Mathematical modelling.
❑ Graphical solution.
Introduction
• Operation research is the science of rational decision-making and the
study, design and integration of complex situations and systems with the
goal of predicting system behavior and improving or optimizing system
performance.
• Operations research tools are not from anyone disciplines operations
research takes tools from different discipline such as mathematics,
statistics, economics, psychology, engineering, etc., and combines these
tools to make a new set of knowledge for decision making. In an
optimization problem one seeks to Maximize or Minimize a specific
quantity (objective), which depends on a finite number of input variables.
• The main purpose of OR is to provide a rational basis for
decisions making in the absence of complete information.
• The central objective of OR is optimization, i.e., to do things best
under the given constraints.
• Optimization: is a branch of OR which uses mathematical
techniques such as linear and non-linear programming to
derive values for system variables that will optimize
performance.
• Steps in solving operations research problems:
Any operations research analyst must follow certain sequential steps to solve the
problem on hand.
Formulation of the problem

Note that: the variables in the problems are written in

Identify the variables and
objective
Capital Litters in the problem, once they entered in the
model it will be a small letters.

Establish the relationship

between the variables and
constraints by constructing
the model

Identify the possible alternative

solutions (Basic Feasible Given the optimality test to
Select the optimal solution
Solution) basic feasible solutions
Mathematical
modelling
• Mathematical Program: is an optimization problem in which the objective
and constraints are given as mathematical functions and functional
relationships.
❑ A Mathematical Model consists of:
1) Decision Variables.
Max: Profit, Production, Performance, etc.
2) Objective Function.
Min: Cost, Time, Effort, Risk, etc.
3) Constraints.
Non-negativity: all variables must be grater than
4) Hidden constraints. or equal zero.
Integer: The variable that not accepted to be
fraction like number of units, number of persons.
❑ The general form of a mathematical programming model is:
1) Decision Variables:
Determine the quantity to be optimized and express it as a mathematical function.
2) Objective Function:
Min or Max 𝑧 = 𝑓(𝑥1 , … , 𝑥𝑛 ) “ total profit, total cost, total number of persons, …”
3) Constraints:
Subject to:
𝑔1 𝑥1 , … , 𝑥𝑛 = 𝑏1
Such that each of the m constraints
𝑔2 𝑥1 , … , 𝑥𝑛 ≤ 𝑏2
relationships involves one of the three signs
… ≥ …
=, ≤, or ≥.
𝑔𝑚 𝑥1 , … , 𝑥𝑛 𝑏𝑚
4) Hidden constraints:
𝑥𝑗 ≥ 0, integer, 𝑗 = 1, … , 𝑛
❑ Linear Programming:
• The problem be a linear if the objective function 𝑓 𝑥1 , … , 𝑥𝑛 , and all
constraints 𝑔𝑗 𝑥1 , … , 𝑥𝑛 , 𝑗 = 1, … , 𝑚 are linear and 𝑥 is continuous.
• Any linear programming model must have the following properties:
i. The relation between variables and constraints must be linear.
ii. The model must have an objective function.
iii. The model must have structure constraints.
iv. The model must have non- negativity constraints.
Example
There are different methods available to
Min 𝑍 = 𝑥1 + 𝑥2
subject to: solve linear programming:
𝑥1 − 𝑥2 = 3 i. Graphical Solution. “ for two variable ” .
𝑥1 , 𝑥2 ≥ 0 ii. Theoretically.
• A solution: is an assignment of values to variables.
• A feasible Solution: is an assignment of values to variables such that all the
constraints are satisfied, and non-negative conditions.
• The objective function value of a solution is obtained by evaluating the objective
function at the given solution.
• An optimal solution: is a feasible solution where the objective function reaches
its max or min.

Max: is one whose objective Min: is one whose objective

function value is grater than to function value is less than to
that of all other feasible that of all other feasible
solutions. solutions.
Sheet (1)
 :Problem (1):
→ Works for 50 hours per week.
→ Manufacturing Profit
Game I 3.5 h 28 $
Game II 4h 31 $
How many games of game I, and game II should be produced to maximize the profit.
(1) Decision Variables: modeling
𝑥𝑖 = The number of units of game 𝑖 products weakly, 𝑖 = 1, 2.
(2) Objective: “ maximize the total profit”
Max 𝑍 = 28𝑥1 + 31𝑥2 Mathematical Model
(3) Constraints: Max 𝑍 = 28𝑥1 + 31𝑥2
subject to: subject to:
3.5𝑥1 + 4𝑥2 ≤ 50 3.5𝑥1 + 4𝑥2 ≤ 50
(4) Hidden constraints: 𝑥𝑖 ≥ 0, and integers, 𝑖 = 1, 2.
𝑥𝑖 ≥ 0, and integers, 𝑖 = 1, 2.
 :Problem (11): “ Blanding Problem “
→ Blends 14 kg Saccharin and 18 kg Dextrose to prepare two new products:
Sweet and Low sugar.
0.4 kg of dextrose.
→ 1 kg of sweet contains:
0.2 kg of saccharin.
0.3 kg of dextrose.
1 kg of low sugar contains:
0.4 kg of saccharin.
sweet → 20 Cent.
→ Profit on each kg of
Low sugar → 30 Cent.

How many games kilograms of each product should be made to maximize the
profit.
 modeling
1 kg of Dextrose Saccharin Profit/ Cent
Sweet 0.4 0.2 20
Low sugar 0.3 0.4 30
Total Quantities/ kg 14 18

(1) Decision Variables:

𝑥1 = The number of kilograms of sweet should be made.
𝑥2 = The number of kilograms of low sugar should be made.
Mathematical Model
(2) Objective: “ maximize the total profit” Max 𝑍 = 20𝑥1 + 30𝑥2
Max 𝑍 = 20𝑥1 + 30𝑥2 subject to:
(3) Constraints: 0.4 𝑥1 + 0.3 𝑥2 ≤ 18
subject to: 0.2𝑥1 + 0.4𝑥2 ≤ 14
0.4𝑥1 + 0.3𝑥2 ≤ 18 “ total quantities of dextrose ” 𝑥1 , 𝑥2 ≥ 0
0.2𝑥1 + 0.4𝑥2 ≤ 14 “ total quantities of saccharin ”
(4) Hidden constraints:
𝑥1 , 𝑥2 ≥ 0.
 :Problem (5):
→ A advertising budget is limited to $ 10,000 a month.
Cost
radio −−−→ $ 15.
→ Each minute of:
Cost
Tv −−−→ $ 300.

→ Show and sell likes to adverting on the radio at least twice as much as on Tv.
→ It is not practical to use more than 400 minutes of radio advertising a month.
→ From past experience, advertising on Tv is estimated to be 25 times as effective
as on radio.

Determine the optimum allocation of the budget to radio and Tv advertising.

 modeling

(1) Decision Variables: Cost/ Effect/

𝑥1 = The number of minutes for radio per month. minutes minutes
𝑥2 = The number of minutes for Tv per month. Radio 15 $ 1
TV 300 $ 25
(2) Objective: “ maximize the total effect”
Max 𝑍 = 𝑥1 + 25𝑥2

(3) Constraints: Mathematical Model

subject to: Max 𝑍 = 𝑥1 + 25𝑥2
15𝑥1 + 300𝑥2 ≤ 10,000 “ total budget ” subject to:
𝑥1 ≥ 2𝑥2 → 𝑥1 − 2𝑥2 ≥ 0 “radio is at least twice as Tv ” 15𝑥1 + 300𝑥2 ≤ 10,000
𝑥1 ≤ 400 “no more than 400 minutes in radio ” 𝑥1 − 2𝑥2 ≥ 0
𝑥1 ≤ 400
(4) Hidden constraints: 𝑥1 , 𝑥2 ≥ 0
𝑥1 , 𝑥2 ≥ 0.
 :Problem (6):
→ John must work at least 20 hours a week.
Can work between
Store 1 −−−−−−−−−−−−→ 5 and 12 hours weekly.
→ In: Can work between
Store 2 −−−−−−−−−−−−→ 6 and 10 hours weekly.
8 at store 1 per hours.
→ Stress:
6 at store 1 per hours.

→ He estimate the total stress for each store at the end of the week is
proportional to the number of hours he works in the store.
How many hours should john work in each store.
 modeling

(1) Decision Variables: Store Number of Stress/

𝑥𝑗 = Number of working hours in store 𝑗 per week, 𝑗 = 1,2. hours hours
min max
(2) Objective: “ min the total stress” 1 5 12 8
Min 𝑍 = 8𝑥1 + 6𝑥2 2 6 10 6
(3) Constraints:
subject to: Mathematical Model
𝑥1 + 𝑥2 ≥ 20 “ the required total number of hours ” Min 𝑍 = 8𝑥1 + 6𝑥2
𝑥1 ≥ 5 “the min hours available in store 1” subject to:
𝑥1 ≤ 12 “the max hours available in store 1”
𝑥1 + 𝑥2 ≥ 20
𝑥2 ≥ 6 “the min hours available in store 2”
𝑥1 ≥ 5
𝑥2 ≤ 10 “the max hours available in store 2”
𝑥1 ≤ 12
𝑥2 ≥ 6
(4) Hidden constraints:
𝑥2 ≤ 10
𝑥𝑗 ≥ 0, j = 1, 2. 𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 :Problem (2):
Emits: 3 units
Low Sulfur Generates: 4 kw
Cost: 60 cent
→ For each hour of use each gallon of:
Emits: 5 units
High Sulfur Generates: 4 kw
Cost: 50 cent
→ The environmental protection agency insists that: the maximum a mount of
sulfur dioxide that can be emitted per hour is 15 units.
→ Suppose that at least 16 kw of electricity must be generated per hour.
How many gallons of low sulfur and low sulfur must be utilized in order to
minimize the cost of fuel.
 modeling
Type of Sulfur Electricity Cost
(1) Decision Variables: fuel dioxide generated “cent”
𝑥1 = Number of gallons of low sulfur used per hour. emitted
𝑥2 = Number of gallons of high sulfur used per hour. Low 3 4 60
Sulfur
(2) Objective: “ min the total cost” High 5 4 50
Min 𝑍 = 60𝑥1 + 50𝑥2 Sulfur
Total Less than 15 At least 16 kw
(3) Constraints: units
subject to:
3𝑥1 + 5𝑥2 ≤ 15 “ the max amount of sulfur ” Mathematical Model
4𝑥1 + 4𝑥2 ≥ 16 “The min electricity that must be generated” Max 𝑍 = 60𝑥1 + 50𝑥2
subject to:
(4) Hidden constraints: 3𝑥1 + 5𝑥2 ≤ 15
𝑥1 , 𝑥2 ≥ 0. 4𝑥1 + 4𝑥2 ≥ 16
𝑥1 , 𝑥2 ≥ 0
 :Problem (3):
→ A trust fund is planning to invest up to 6000 $ in two types of bonds A and B.
8% of A.
→ Carries a dividend of:
10 % of B.

→ No more than 4000 $ may be invested in bond B.

→ At least 1500 $ must be invested in bond A.
How much should be invested in each types of bond to Maximize the funds
return.
 modeling
(1) Decision Variables:
𝑥1 = The amount of money invested in bond A.
𝑥2 = The amount of money invested in bond B. Mathematical Model
Max 𝑍 = 0.08𝑥1 + 0.1𝑥2
(2) Objective: “ max the total profit” subject to:
Max 𝑍 = 0.08𝑥1 + 0.1𝑥2 𝑥1 + 𝑥2 ≤ 6000
𝑥2 ≤ 4000
(3) Constraints: 𝑥1 ≥ 1500
subject to: 𝑥1 , 𝑥2 ≥ 0
𝑥1 + 𝑥2 ≤ 6000 “ Total budget”
𝑥2 ≤ 4000 “ The max amount that invested in bond B ”
𝑥1 ≥ 1500 “ The min amount that invested in bond A ”

(4) Hidden constraints:

𝑥1 , 𝑥2 ≥ 0.
 :Problem (4):
→ Company operates 10 hours a day.

product Process 1 Process 2 Process 3 Unit profit

→ ““minutes” “minutes” “minutes”
1 10 6 8 2$
2 5 20 10 3$

Determine the optimal max of the two products.

 modeling
(1) Decision Variables:
Mathematical Model
𝑥𝑖 = Number of units of product 𝑖, 𝑖 = 1, 2.
Max 𝑍 = 2𝑥1 + 3𝑥2
subject to:
(2) Objective: “ max the total profit”
10𝑥1 + 5𝑥2 ≤ 600
Max 𝑍 = 2𝑥1 + 3𝑥2
6 𝑥1 + 20𝑥2 ≤ 600
8 𝑥1 + 10𝑥2 ≤ 600
(3) Constraints:
𝑥1 , 𝑥2 ≥ 0, and integers
subject to:
10𝑥1 + 5𝑥2 ≤ 600 “ Total number of minutes of process 1”
6 𝑥1 + 20𝑥2 ≤ 600 “ Total number of minutes of process 2”
8 𝑥1 + 10𝑥2 ≤ 600 “ Total number of minutes of process 3”

(4) Hidden constraints:

𝑥1 , 𝑥2 ≥ 0, and integers.
Graphical solution.
 The first method for the solution of a linear
programming problem:
Graphical Method
• The graphical method used when we have only two decision variables.
• To deal with more decision variables by graphical method will become
complicated, because we must deal with planes instead of straight lines.
Hence in graphical method let us limit ourselves to two variable
problems.
• The graphical method includes two major steps:
❑ Find the feasible region: the determination of solution space that defines
the feasible solution. To determine the feasible solution, we have the
following steps.
➢ Step 1: Since the two decision variables 𝑥1 and 𝑥2 are non-negative “
𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 ”, consider only the first quadrant of 𝒙𝒚 −coordinate plane where
𝒙𝟏 → 𝒙 − 𝒂𝒙𝒊𝒔, 𝒙𝟐 → 𝒚 − 𝒂𝒙𝒊𝒔.
➢ Step 2: The Inequalities (structural constraints) are considered to be
Equations. This is because one cannot draw a graph for inequality. Thus, plot
each constraints as an equation ≡ line in the plane.
𝑎𝑥1 + 𝑏𝑥2 ≤, ≥ 𝑐 → 𝑎𝑥1 + 𝑏𝑥2 = 𝑐
➢ Step 3: Draw the line 𝑎𝑥1 + 𝑏𝑥2 = 𝑐 for each constraint.
𝑐
put 𝑥1 = 0 → 𝑥2 =
𝑏
𝑐
put 𝑥2 = 0 → 𝑥1 =
𝑎
𝑐
Thus, the two points used to draw the line 𝑎𝑥1 + 𝑏𝑥2 = 𝑐 in the graph are 0,
𝑏
𝑐 𝑥2
and ,0 .
𝑎
0, 𝑥2

0,0
𝑥1 , 0 𝑥1
➢ Step 4: Each line divides the first quadrant into two regions say 𝑅1 and 𝑅2 .
Suppose 𝑥1 , 𝑥2 is a point in 𝑅1 , if this point satisfies the inequality < then
shade the region 𝑅1 . If 𝑥1 , 𝑥2 does not satisfy the inequality, then shade the
region 𝑅2 . For simplicity, always take (0,0) which is a point under the line ( in
𝑅1 ). 𝑥2

0, 𝑥2

𝑥1
0,0 𝑥1 , 0
 ➢ Step 5: Corresponding to each constrain, we obtain a shaded region. The
intersection of all these shaded regions is the feasible solution “ feasible region
”.
❑ Determine of the optimal solution from the feasible region, using
corners of the feasible area as follows:
➢ Step 1: Find the coordinates of each corner of the feasible region. This
coordinates can be obtained from the graph but if the point is intersection
between two lines, we get this point by solving the two equations.
➢ Step 2: At each corner point compute the value of the objective function “ z “.
➢ Step 3: Identify the corner point is the optimal solution, which satisfies the
objective function ( satisfies Max or Min ). Thus, the coordinate of this corner
point is the optimal solution and the value of z is the optimal value.
Sheet (1)
 :Problem (6): Graphical Method

Mathematical Model
Min 𝑍 = 8𝑥1 + 6𝑥2
The
subject to: points of
Line 1: 𝑥1 + 𝑥2 = 20 → 0,20 , 20,0 .
𝑥1 + 𝑥2 ≥ 20 → 1 each line Line 2: 𝑥1 =5 → 5,0 .
𝑥1 ≥ 5 → 2 Line 3: 𝑥1 = 12 → 12,0 .
𝑥1 ≤ 12 → 3 Line 4: 𝑥2 =6→ 0,6 .
𝑥2 ≥ 6 → 4 Line 5: 𝑥2 = 10 → 0,10 .
𝑥2 ≤ 10 → 5
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 3:
𝑥1 + 𝑥2 = 20 𝑥2 = 8
𝑥1 = 12
To find the point B we solve the
equations of Line 1 and Line 5:
𝑩 𝑪 𝑥1 + 𝑥2 = 20 𝑥1 = 10
𝑥2 = 10
𝑨

A: (12,8)
B: (10,10)
C: (12,10)
• The optimal solution is: 𝑧𝑚𝑖𝑛 = 140.

• occurs at: 𝑥1 = 10, 𝑥2 = 10.

• Type of solution: Unique optimal solution.

 :Problem (7): Graphical Method

Mathematical Model The

Max 𝑍 = 2𝑥1 + 4𝑥2 points of
each line
subject to: Line 1: 𝑥1 + 2𝑥2 = 5 → 0,
5
, 5,0 .
𝑥1 + 2𝑥2 ≤ 5 → 1 2

𝑥1 + 𝑥2 ≤ 4 → 2
Line 2: 𝑥1 + 𝑥2 = 4 → 0,4 , 4,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 2:
𝑥1 + 2𝑥2 = 5 𝑥1 = 3, 𝑥2 = 1
𝑥1 + 𝑥2 = 4

𝑩 A: (3,1)
B: (0,5/2)
C: (4,0)
D: (0,0)
𝑨

𝑫 𝑪
• The optimal solution is: 𝑧𝑚𝑎𝑥 = 10.

• occurs at: 𝑥1 = 3, 𝑥2 = 1, 𝑥1 = 0, 𝑥2 = 5/2, and all the points between these

two points .

• Type of solution: Infinite optimal solution contained in the line segment 𝐴𝐵.
 :Problem (11): Graphical Method

Mathematical Model The

Max 𝑍 = 20𝑥1 + 30𝑥2 points of
each line
subject to: Line 1: 0.4𝑥1 + 0.3𝑥2 = 18 → 0,60 , 45,0 .
0.4𝑥1 + 0.3𝑥2 ≤ 18 → 1
0.2𝑥1 + 0.4𝑥2 ≤ 14 → 2 Line 2: 0.2𝑥1 + 0.4𝑥2 = 14 → 0,35 , 70,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 2:
0.4𝑥1 + 0.3𝑥2 = 18
0.2𝑥1 + 0.4𝑥2 = 14 𝑥1 = 30, 𝑥2 = 20

A: (30,20)
𝑪 B: (45,0)
C: (0,35)
𝑨
D: (0,0)

𝑫 𝑩
• The optimal solution is: 𝑧𝑚𝑎𝑥 = 1200.

• occurs at: 𝑥1 = 30, 𝑥2 = 20.

• Type of solution: Unique optimal solution.

 :Problem (8): Graphical Method

Mathematical Model The

Max 𝑍 = 3𝑥1 + 2𝑥2 points of
each line
subject to: Line 1: 2𝑥1 + 𝑥2 = 2 → 0,2 , 1,0 .
2𝑥1 + 𝑥2 ≤ 2 → 1
3𝑥1 + 4𝑥2 ≥ 12 → 2 Line 2: 3𝑥1 + 4𝑥2 = 12 → 0,3 , 4,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
No feasible region exists, so there is no
solution to the problem
 :Problem (18): Graphical Method

Mathematical Model
The
Max 𝑍 = 200𝑥1 + 300𝑥2 points of Line 1: 2𝑥1 + 3𝑥2 = 1200 → 0,400 , 600,0 .
subject to: each line
2𝑥1 + 3𝑥2 ≥ 1200 → 1 Line 2: 𝑥1 + 𝑥2 = 400 → 0,400 , 400,0 .
𝑥1 + 𝑥2 ≤ 400 → 2
2𝑥1 + 1.5 𝑥2 ≤ 400 → 3 Line 2: 2𝑥1 + 1.5𝑥2 = 900 → 0,600 , 450,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
No feasible region exists, so there is no
solution to the problem.
 :Problem (18): Graphical Method

Mathematical Model
The
Max 𝑍 = 400𝑥1 + 600𝑥2 points of Line 1: 2𝑥1 + 𝑥2 = 70 → 0,70 , 35,0 .
subject to: each line
2𝑥1 + 𝑥2 ≥ 70 → 1 Line 2: 𝑥1 + 𝑥2 = 40 → 0,40 , 40,0 .
𝑥1 + 𝑥2 ≥ 40 → 2
𝑥1 + 3𝑥2 ≥ 90 → 3 Line 3: 𝑥1 + 3𝑥2 = 90 → 0,30 , 90,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
Since the feasible region has no bounds,
there are unbounded solutions to the
problem.
 :Problem (2): Graphical Method

Mathematical Model The

Min 𝑍 = 60𝑥1 + 50𝑥2 points of
each line
subject to: Line 1: 3𝑥1 + 5𝑥2 = 15 → 0,3 , 5,0 .
3𝑥1 + 5𝑥2 ≤ 15 → 1
4𝑥1 + 4𝑥2 ≥ 16 → 2 Line 2: 4𝑥1 + 4𝑥2 = 16 → 0,4 , 4,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 2:
3𝑥1 + 5𝑥2 = 15 5 3
𝑥1 = , 𝑥2 =
4𝑥1 + 4𝑥2 = 16 2 2

A: (5/2,3/2)
B: (5,0)
C: (4,0)
𝑨

𝑩
𝑪
• The optimal solution is: 𝑧𝑚𝑖𝑛 = 225.

• occurs at: 𝑥1 = 5/2, 𝑥2 = 3/2.

• Type of solution: Unique optimal solution.

 :Problem (3): Graphical Method

Mathematical Model
The
Max 𝑍 = 0.08𝑥1 + 0.1𝑥2 points of Line 1: 𝑥1 + 𝑥2 = 6000 → 0,6000 , 6000,0 .
subject to: each line
𝑥1 + 𝑥2 ≤ 6000 → 1 Line 2: 𝑥2 = 4000 → 0,4000 .
𝑥2 ≤ 4000 → 2
𝑥1 ≥ 1500 → 3 Line 3: 𝑥1 = 1500 → 1500,0 .
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 2:
𝑥1 + 𝑥2 = 6000
𝑥1 =2000, 𝑥2 = 4000
𝑨
𝑥2 = 4000
𝑪
A: (2000,4000)
B: (6000,0)
C: (1500,4000)
D: (1500, 0)

𝑫 𝑩
• The optimal solution is: 𝑧𝑚𝑎𝑥 = 560.

• occurs at: 𝑥1 = 2000, 𝑥2 = 4000.

• Type of solution: Unique optimal solution.

 :Problem (4): Graphical Method

Mathematical Model
The
Max 𝑍 = 2𝑥1 + 3𝑥2 points of Line 1: 10𝑥1 + 5𝑥2 = 600 → 0,120 , 60,0 .
subject to: each line
10𝑥1 + 5𝑥2 ≤ 600 → 1 Line 2: 6𝑥1 +20𝑥2 = 600 → 0,30 , (100,0)
6𝑥1 + 20𝑥2 ≤ 600 → 2
8𝑥1 + 10𝑥2 ≤ 600 → 3 Line 3: 8𝑥1 + 10𝑥2 = 600 → 0,60 , 75,0
𝑥𝑗 ≥ 0, 𝑗 = 1,2.
 To find the point A we solve the
equations of Line 1 and Line 2:
10𝑥1 + 5𝑥2 = 600 900 240
𝑥1 = , 𝑥2 =
6𝑥1 +20𝑥2 = 600 17 17

900 240
A:( , )
17 17
B: (60,0)
C: (0,30)
D: (0, 0)
𝑪
𝑨

𝑫
𝑩
• The optimal solution is: 𝑧𝑚𝑎𝑥 = 2520/17.

• occurs at: 𝑥1 = 900/17, 𝑥2 = 240/17.

• Type of solution: Unique optimal solution.

 :
Problem (14): Graphical Method
Mathematical Model The
Max 𝑍 = 𝑥1 + 2𝑥2 points of Line 1: 𝑥1 = 80 → 80,0 .
each line
subject to:
𝑥1 ≤ 80 → 1 Line 2: 𝑥2 = 60 → 0,60 .
𝑥2 ≤ 60 → 2
5𝑥1 + 6𝑥2 ≤ 600 → 3 Line 3: 5𝑥1 + 6𝑥2 = 600 → 0,100 , 120,0
𝑥1 + 2𝑥2 ≤ 160 → 3
𝑥𝑗 ≥ 0, 𝑗 = 1,2. Line 4: 5𝑥1 + 6𝑥2 = 600 → 0,80 , 160,0
 To find the point A we solve the
equations of Line 1 and Line 3:
𝑥1 = 80 𝑥1 = 80, 𝑥2 =
100
3
5𝑥1 +6𝑥2 = 600
To find the point c we solve the
equations of Line 2 and Line 4:
𝑥2 = 60
𝑫 𝑪 𝑥1 +2𝑥2 = 160
𝑬 To find the point E we solve the
equations of Line 3 and Line 4:
5𝑥1 +6𝑥2 = 600
𝑥1 = 60, 𝑥2 = 50
𝑨 𝑥1 +2𝑥2 = 160

100
A: (80, ) E: (60, 50)
3
𝑭
𝑩 B: (80,0) F: (0, 0)
C: (40,60)
D: (0, 60)
• The optimal solution is: 𝑧𝑚𝑎𝑥 = 160.

• occurs at: 𝑥1 = 40, 𝑥2 = 60, 𝑥1 = 60, 𝑥2 = 50, and all the points between
these two points .

• Type of solution: Infinite optimal solution contained in the line segment 𝐶𝐸 .

Every linear programming has either:

• A unique optimal solution: Only one corner point in the feasible area
satisfies the objective function.
• Finite (multiple) optimal solutions: more than corner points contained in
the line segment 𝐴𝐵 , in the feasible area satisfies the objective function.
• Unbounded optimal solutions: The feasible region has no bounds.
• Infeasible solutions: No feasible area.