Linear Programming: Model

Formulation and Graphical Solution

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 Linear Programming: Model
Formulation and Graphical Solution
• Model Formulation
• A Maximization Model Example
• Graphical Solutions of Linear Programming
Models
• A Minimization Model Example
• Irregular Types of Linear Programming Models
• Characteristics of Linear Programming
Problems
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Objective
ribavirin damnTaverns
prurigo .

ใช้ในการแก้ปัญหาการจัดสรรทรัพยากร
intoni nous Essen

(Resource allocation) ที่ใช้ในการดาเนินงานให้

บรรลุเป้าหมายหรื อวัตถุประสงค์ (Objective) ที่
ต้องการ (Maximization or Minimization)
ภายใต้ขอ้ จากัดของทรัพยากร และ เป้าหมาย
ex .
Ensor omnivores bafowdosuniisaosouaiooso.msa → Guard
↳ Two
qindarka sangria 696 maximize ⑧Koo #*
msbdiboolvfofibgpggggfgnqeg.gs
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Linear Programming: An Overview

Steps in application:
1. Identify problem as solvable by
linear programming.
2. Formulate a mathematical model of
the unstructured problem.
3. Solve the model.
4. Implementation

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
Ewaownssoonest
1. homewardNow 660%8601086018866hornbeamsbridal .

•
• oiobbdsnisokasn.dk8880 ( Decision variables )

now saturation Abortion Woo : 2 B Ianniswife :3 Choinski Woo : I

g ,
.

Antonio
ysw-iosoiivsogso.ph
→
B
C
maximum profit
objective function ✓ or faeries as parameters code: )
\
minimum cost

2. antagonisms

3. 66EUR .

4. 892T'dno,
 1. Identify problem

• Decision variables
• Objective function - a linear mathematical relationship
describing an objective of the firm, in terms of decision

:
variables - this function is to be maximized or minimized.
• Constraints – requirements or restrictions placed on the firm
by the operating environment, stated in linear relationships
of the decision variables.
• Parameters - numerical coefficients and constants used in
the objective function and constraints.

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 2. Formulate the problem.

Step 1 : Clearly define the decision variables

Step 2 : Construct the objective function

Step 3 : Formulate the constraints

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation
A Maximization Example (1 of 3)

• Product mix problem - Beaver Creek Pottery Company

tone
• How many bowls and mugs should be produced to
maximize profits given labor and materials constraints?
• Product resource requirements and unit profit:

Resource Requirements
Product Labor Clay Profit
(hr/unit) (lb/unit) ($/unit)
Bowl 1 4 40
Mug 2 3 50
40/20 120/40

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation
A Maximization Example (2 of 3)

Decision x1 = number of bowls to produce per day

Variables: x2 = number of mugs to produce per day
Objective Maximize Z = $40x1 + $50x2
Function: Where Z = profit per day

Resource 40 hrs of labor per day

Availability: 120 lbs of clay
44 , t 8×2 f 320

Resource 1x1 + 2x2 40 hours of labor

Constraints: 4x1 + 3x2 120 pounds of clay
511 f 200

Non-Negativity x1 0; x2 0
Constraints: Xz E 40

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation
A Maximization Example (3 of 3)

Complete Linear Programming Model:

Maximize Z = 4071
,
-150×2
subject to: Xp -12712 £40
ST : 44 , -137124120

TX -18112£ 320
,

5428200
712840
X 1- 80£40
,

X f -
40
,

4,40 9270

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 Methods for LP Solving
1. Graphic Method
• Graphical solution is limited to linear programming
models containing only two decision variables (can
be used with three variables but only with great
difficulty).
• Graphical methods provide visualization of how a
solution for a linear programming problem is
obtained.
2. Simplex Method
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Coordinate Axes
Graphical Solution of Maximization Model (1 of 12)

isoprofitcine
eexxttteemmeeppooiinntt

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2 40 •

4x1 + 3x2 120

x1, x2 0
40=360
'
10.8=400
£ 20
-

I.
-

X Xz Z Yi Ey -140
-

-
,
A O O O
"
20 1000 '
B O
X
- 4=-12×+20
C

D
24

30
8
O
1360
1200
(
feasible area

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 Both Constraints
Graphical Solution of Maximization Model

Maximize Z = $40x1 + $50x2

subject to: 1x1 + 2x2 40
4x1 + 3x2 120
x1, x2 0

x1 x2 Z
A
B B
C C
A D
D
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
(about ; 11241+2181 = 40

120
clay ; 41241+3187
=

nwoognfwginrnoufbwonarofokqo.in
Slack of BYE 6880%66

8wonsr9Wg/
\
surplus

f slack → -15

7 Surplus →
-

S
 Slack Variables

• Standard form requires that all constraints

be in the form of equations (equalities).
• A slack variable is added to a constraint
(weak inequality) to convert it to an
equation (=).
• A slack variable typically represents an
unused resource.
• A slack variable contributes nothing to the
objective function value.
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Linear Programming Model: Standard Form

06Wh 888 labour UNA

ps
=
,

Max Z = 40x1 + 50x2 + s1 + s2

subject to:1x1 + 2x2 + O s1 = 40
4x1 + 3x2 + c s2 = 120
x1, x2, s1, s2 0
Where: ↳ so sworn : today una

x1 = number of bowls
x2 = number of mugs
s1, s2 are slack variables

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation
A Minimization Example

• Two brands of fertilizer available - Super-Gro, Crop-Quick.

• Field requires at least 16 pounds of nitrogen and 24 pounds
of phosphate.
• Super-Gro costs $6 per bag, Crop-Quick $3 per bag.
• Problem: How much of each brand to purchase to minimize
total cost of fertilizer given following data ?
Chemical Contribution

Nitrogen Phosphate Cost

Brand
(lb/bag) (lb/bag)
Super-gro 2 7, O i
0
4 72326$ -232

Crop-quick 4 X
,
0 = 0 3 Xz 293$ -724

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
2X ,
-14712716
474+3712724

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation
A Minimization Example (2 of 7)
is
Decision Variables: X
, number of super grow

Xz is number of crop quick

different from example mug and clay

④ it is recent ,
.

The Objective Function: z =

6X , -13112

2X ,
Model Constraints: 471 -1442716
, -13712724
X, 70
gxz

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation and Constraint Graph
A Minimization Example (3 of 7)

i÷÷÷÷÷÷÷
18

:÷÷
16

Minimize Z = $6x1 + $3x2 14

subject to: 2x1 + 4x2 16 12

4x1 + 3x2 24 10 .
x1, x2 0
8

:
ai
6

4
.
2

2 4 6 8 10 12 14 16

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 LP Model Formulation and Constraint Graph
A Minimization Example (3 of 7)

Minimize Z = $6x1 + $3x2

subject to: 2x1 + 4x2 16
4x1 + 3x2 24
x1, x2 0

x1 x2 Z A
A
B B
C
C
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Surplus Variables
A Minimization Example (6 of 7)
• A surplus variable is subtracted from a constraint
to convert it to an equation (=).
• A surplus variable represents an excess above a
constraint requirement level.
• Surplus variables contribute nothing to the
calculated value of the objective function.
• Subtracting slack variables in the farmer problem
constraints:
2x1 + 4x2 - s1 = 16 (nitrogen)
4x1 + 3x2 - s2 = 24 (phosphate)
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Graphical Solutions
A Minimization Example (7 of 7)

Minimize Z = $6x1 + $3x2 + 0s1 + 0s2

subject to: 2x1 + 4x2 – s1 = 16
4x1 + 3x2 – s2 = 24
x1, x2, s1, s2 0

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 Irregular Types of
Linear Programming Problems

• For some linear programming models, the

neind imousgiwnoig.ae#,.g
general rules do not apply. ↳

• Special types of problems include those

with:
– Multiple optimal solutions
– Infeasible solutions
– Unbounded solutions
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))
 Multiple Optimal Solutions
Beaver Creek Pottery Example

Objective function is parallel to a constraint line.

Maximize Z=$40x1 + 30x2
subject to: 1x1 + 2x2 40
4x2 + 3x2 120
x 1, x 2 0
Where:
x1 = number of bowls
x2 = number of mugs

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 unbounded problem
multiple optimal solutions
2=47 , -12112

X 74
maximize 2 =
4011 , +00712 ,

Xzf 2

f 40
-
①
X, -12×2
Xl ,
11230
Xz
44 , -13112 f 720 -
②

Xz ① x4 ; 471 , -18112=160
-

③
10,401 . ③ ② ;-

5×2
= -
40

Xz =
-

8
(0,20) @
X -16=40 14,4
,
• •
X X ,
=
56
•
712=2
130,01 140,0 ) 7
X,
.

tie
Infeasible problem Xz x , -4

2=571 , -13112 1-1,6 )

•
712--6
47 , -12112 £8
X
,
74 10,4) •

:::÷ .

"
7. NO COMMON AREA ? •
I
 An Infeasible Problem

Every possible solution violates at least one

constraint:
Maximize Z = 5x1 + 3x2 Infeasible problem
2=571 ,
subject to: 4x1 + 2x2 8 31/2
+

47 , t 2X £8
x1 4
z

X
,
74

x2 6 71276

x 1, x 2 0 X, g 7/270

Linar Programming : Formulation & Graph by Bernard

Taylor III (Intro to Management Science 12 ed))
 An Unbounded Problem

Value of objective function increases indefinitely:

Maximize Z = 4x1 + 2x2 Z = TX , -1 2X
z
X
subject to: x1 4 Xzf
, 74
2

x2 2 Xl ,
11230
Xz
x 1, x 2 0

144
.
712=2
X,

tie
Linar Programming : Formulation & Graph by Bernard
Taylor III (Intro to Management Science 12 ed))