Let:

x = pollutant reduction from factory X.

y = pollutant reduction from factory Y.
z = pollutant reduction from factory Z.
Objective Function:
Minimize Z = 15x + 10y + 20z
Z - 15x - 10y - 20z = 0

Eq. 1

Subject to Constraints:
TOC: 0.1x + 0.2y + 0.4z >= 30
TON: 0.45x + 0.25y + 0.3z >= 40
x,y,z >= 0
Subtract e1 and e2 from L.H.S of constraint equations because inequality sign is "
0.1x + 0.2y + 0.4z - e1 = 30
Eq. 2
0.45x + 0.25y + 0.3z - e2 = 40
Eq. 3
x, y, z , e1, e2 >= 0
1st Iteration
row 0
row 1
row 2

Z
1
0
0

x
-15
0.1
0.45

row 0' = row 0 +10*row2'

row 1' = row 1-0.2*row2'
row 2' = row2/0.25

Z
1
0
0

x
3
-0.26
1.8

Z
0
0
-1

x
1
0
0

2nd Iteration

3rd Iteration
row 0'' = row0'/3
row 1'' = row1'+0.26*row0''
row 2'' = row2'-1.8*row0''

Optimal Solution:

lity sign is ""

y
-10
0.2
0.25

z
-20
0.4
0.3

e1
0
-1
0

e2
0
0
-1

RHS
0
30
40

Ratio Test
0
150
160

y
0
0
1

z
-8
0.16
1.2

e1
0
-1
0

e2
-40
0.8
-4

RHS
1600
-2
160

Ratio Test
533
8
89

y
0
0
1

z
-3
-1
6

e1
0
-1
0

e2
-13
-3
20

RHS
533
137
-800

Ratio Test
-200
-256
-133

Optimal Solution: x* = 533

All Negative means can't be solved further

Supply in million gallons/day from the local reservoir = X

Supply in million gallons/day from the pipeline = Y
12
10

Objective Function:
Minimize Z = 300X + 500Y
Subject to Constraints:
X+ Y >=10
X<=5
Y>= 6
Y<=10
X,Y >= 0

Eq.1
Eq.2
Eq.3
Eq.4

2
0
0

Eq. 3
Y
10
0

X
0
10

Eq. 2
X
5
5

= Feasible Region

Eq. 1
X
0
10

Y
6
6

Corner Points: A(4,6), B(5,6), C(5

Eq. 4
Y
10
0

X
0
10

Y
10
10

Optimal Solution: Z* = 4200; X*

Eq.
1
Eq.
2

10

12

= Feasible Region
Optimal Solution By Corner Point Method

ints: A(4,6), B(5,6), C(5,10) and D(0,10)

X
4
5
5
0

Y
6
6
10
10

olution: Z* = 4200; X* = 4; Y* = 6

Z
4200
4500
6500
5000

A = $ invested in Project A
B = $ invested in Project B

Corner Point Meth

Objective Function:
Maximize Z = 0.1A + 0.15B

600000
500000

Subject to:
A+B <= 500,000
0.6B -0.4A <= 0
A,B >= 0
Eq 1
A
0
500,000

Eq. 1
Eq. 2

A
0
500,000
750,000

B
0
333,333
500,000

Corner Points = A(0,0); B(200000,300000) & C(500000,0)

A
0
300,000
500,000
Optimal Solution:

B
0
200,000
0

300000
200000
100000

Eq 2

B
500,000
0

400000

Z
0
60,000
50000

A* = 300,000; B* = 200,000 and Z* = 60000

0
0

100000 200000 300000 400

A

Shaded region in yellow is the fea

Corner Point Method for Feasible Solution

Equation 1
Equation 2

0000 200000 300000 400000 500000 600000 700000 800000

A

gion in yellow is the feasible region

Let X be the number of units of Model A

Let Y be the number of units of Model B
Objective Function:
Maximize Z = 45X + 50Y

Optimal Solution By Corne

300

Subject to:
X+ Y <= 250
250X + 400Y <= 70,000
X, Y >= 0
Equation 1
X
Y
0
250
250
0
Equation 2
X
Y
0
175
280
0

250
200
150
100
50
0

50

100

150

200

Corner points = A(0,175); B(200,50); C(250

X
0
200
250

Y
175
50
0

Optimal Solution By Corner Point Method

Equation 1
Equation 2

= Feasible
Region

100

150

200

250

300

nts = A(0,175); B(200,50); C(250,0)

Z
8750
11,500
11,250

Optimal Solution:

X* = number of units of Model A = 200;Y* = number of units of M

= number of units of Model B = 50 & Z* = 11,500

Suppose that:
x = Acres of Crop A that must be planted
y = Acres of Crop B that must be planted

Eq. 1
x
0
150

Objective Function:
Maximize Z = 140x + 235y
Subject to:
x + y < = 150
x + 2y <= 240
0.3x + 0.1y <= 30
x,y >= 0

Eq. 1
Eq. 2
Eq. 3

Solving Eq.1& Eq.2:

Eq.1:
x = 150 - y
Put in Eq.2150 - y + 2y = 240
y = 90
Therefore: x = 60
Corner Point = (60,90)
Solving Eq.1& Eq.3:
0.3*(150-y) + 0.1y =0
(-0.2)* y = -15
y = 75
we get: x = 75
Corner Point = (75,75)

350
300
250
200
150
100
50
0
0

x
0
60
75
100

y
150
0

50

y
120
90
75
0

100

Z
28,200
29,550
28,125
14,000

Optimal Solution:
Z* = 29,500; x* = 60 and y* = 90

150

Eq. 2
x
0
240

Eq. 3
y
120
0

x
0
100

y
300
0

Equation
1

= Feasible
Region

100

150

200

250

300

X = Number of bags of Brand X

Y = Number of bags of Brand Y

15

Objective Function:
Minimize Z = 25X + 20Y

10

Subject to Constraints:
Nut.Element A:
2X + Y >= 12
Nut.Element B:
2X + 9Y >= 36
Nut.Element C:
2X + 3Y >= 24
X, Y >= 0
Equation 1
X
Y
0
12
6
0

0
0

10

Solving Eq.1 and Eq.3:

We get: Y = 6 and X = 3
Point B = (3,6)
Solving Eq.2 and Eq.3:
Y = 2 and X = 9
Point C = (9,2)

Equation 3
X
Y
0
8
12
0

Y
12
6
2
0

= Feasible
Region

Equation 2
X
Y
0
4
18
0

X
0
3
9
18

Eq.1
Eq.2
Eq.3

Corner points: A (0,12); B (3,6); C (9,2); D (1

Z
240
195
265
450

Optimal Solution: Z* = 195; X* = 3 and Y* =

Equati
on 1

10

12

Feasible
gion

2); B (3,6); C (9,2); D (18,0)

= 195; X* = 3 and Y* = 6

14

16

18

20

Optimal Solution By Corner Point Method