maximizing

.µ. *µµ
DECISION :
--fg@_-f_-g-- fotF-carpentry trucks
✗ =/ 000
~
hours of

Finishing hour
4=2000 trains
demand truck

2- =
1,550,000
→ 0

☒ +1251=05000 Xty =
3000 ✗ =
2000
3000
11=5,000 ✗
12000,0 )
=

15000,0) ( 3000,0 )
→ 0
→0
✗ +24=5000 ✗ ty =
3000 elimination method
:

124=5000 y
=
3000 will use the inequalities of the lines involved
- in the elimination

4- -2 ( 0,3000)
2500 kt y
=
3000 1×+24=5000
y
=

☒ =
2000
☒ty=3

identifythecorn
( 0,2500 ) 2000
y
=

* get the feasible areas

y ✗ + y =
3000 ✗ 1-24--5000
* ✗ 1-110007=3000
× .
✗ +4000=5000
" ""°
" "" " "°
4500 -

12000,1000 ) ✗ =
1000

4000 -

3500 -

3000 • * use the objective function to determine the minimum maximum /

god ??@£
"

2- =
450×1-5504

÷.×÷÷:÷:÷
( 1000,2000)
2000 •
45011000/1-55012000 ) 2=45012000/1-55010)
-
2- =

=
450000 t 1100000 -2=900,000
1500 -
,
12000.1000 )
2- =
4501011-550/2500)
woo - • ( 2000,1000 ) 2- =
1,375,000
2=4501200011-55011000) 10,0)

500 -
=
9000001-550000 2- = 4501011-55010 )
2- =
1,450,000 2- =D

500 1000 1500 2000 2500 3000 3500 4000 4500 5000
?⃝
 Milkha
,.fÉ•••(
I
=

÷i !÷
-

--Eo
2

1.50 -

1.25 -

I - ✗ = no .

Of brownies
y
=
no .
Of icecream
:
Objective Function
0.50 -
miniMUMlost=50×t2Oy_②-
025 subject to :

1É•
-

calories
400×1-2009>-500
-

constraints :

0 '

2.50 3
✗ 3 ✗ + 2y 26 oz chocolate
025 0-50 075 I 1.25 1.50 1.75 2 2.25 2.75
.

✗ y 7- 0 ( nonnegative
)
,
Constraint
90
3×1-25=6
= 50×1-20 y
501011-2013 ) 400×+120091--500

(h
'

point
✗ "

-0-6
¥¥=%%
3×+2103=6 µ,
=

3×-76 point
*
✗
=
50×1-20 y 12,0 ) 3- -3 =
1.25

501271-201 :O) ( 2,0 ) 400×1-2004=500

①
= ✗ 4 ✗ =
2
40010 ) 1-2004--500
=

-00-1 3×1%29=6
zndP°i*
"

zrdÑ
of
2004=500
31071-24=6 Looy
=
soo

decision : 29=6 -200 TO

2- I 10,3) 10.2.5 )
2.5
0 no .

of brownies
& -3 no -

of icecream y=s y=

✗ 0
•
0 brownies I 3 icecream to

Minimizing
=
• •

y=3 satisfy nutritional req .

binawasanyung variables d
yung constraints
at :
minimum cost .

note
in order to make a sample graph .
?⃝
?⃝
 if inequality sign is
:

new objective Function I :

MAX .
2 = 2x , - ✗ 2+2×3 t
0s ,
1- Oszt 0s , I multiply to -1 if Maximizing profit :

gross profit

#gg
subject to : 2J =

constraints Cj =
profit per unit
2x ✗ at S 10 Cj -2J Net Profit

€#→
t ,
= =
,

" +2×2 -2×3+52=20

✗ at 2×3 t Sz 5 =

#%
rod
,
✗
3 is ' ,
52,53>-0 Qty ÷ optimum
•

"
÷H¥:÷¥÷
.

Cj
-112+2×3=-5

""

Replacing Entries : Remaining Entries :

"
"" " ""
I 2 -2 0 I 0 20 1=20
b
20 ÷
old row entry entry below / above pivot replacing row entries pivotal row
pivotal row ÷
✗
pivot
-

0 83

|
10 ÷ 2 =
5 Sz Row : S3 Row

}
2 ÷ 2 = I
20 -
I (5) =
15 5- 0 (5) = 5

I ÷ 2 = 1
I -
I (1) =
O O
-

O (1) = 0

2 I 11£ )= 2- -01£ )= 1

/
0 ÷ =
2- I
I @ 1=-2
2J
I ÷ 2
=
I -2 -

2-0 @ 1=2
0 ÷ 2 = 0 0 (1-2)=-5
-
I O -

O (E) = 0
0 C)
/ 0-0101--0
=
O
=
÷ 2 l l I
-

Table II
0-1101=0 I -0101=1

±oo
-

I [2×11-42 210] -

I →
-2×1
-

xzts ,
=
-10

✗ , -12-1<=20 → × ,
+2×2+52=20

✗ 21-2×3 =
5 → Xz 1-2×3+53=5

Zj 10 2 I 0 I 0 0

simplex method
Replacing Remaining o1dÉmbPiyot
!ng1#
:
Entries Entries : ✗
replacing row

pivotal row ÷ plot × , ROW :

82 ROW :

| || |
É-tñ¥É÷¥a|µµard#É
b- ÷ 2=5-2 5-015-27=5 15 C- 2)
O÷2= O l 010 ) I 0 f-2) ( O ) 0
-

= - =

,÷a=± ± -

oi =÷
2÷2 I O_0 (1) 0 (2) (1)
=
: -2 -
= 0

0 ÷ 2=0 f- -010) = I "

it " ' " ' -

stay:µw
o =o
ii. ¥311.1
ou ,=o
!
o
-

i÷a= : o-oe.no
:

"

=¥ÉoÉopti¥!oi
!
I yay

optimum

( /
getting

/
nextstep after

_÷a×IÉ o f |
Decision
:

✗ 1=5

✗ 2=0

✗ 5- I 2×5=10 -5
"

sa go

2×5-2

¥*iÉ
Max 2- = 15

Maxi -

negative / oung
Cj -

Zj
minimize -

positive ring
fj -2J
 Constraints objec - Function

→ surplus
↳ Xitxztositoszt MA
,
+ MA A- Artifi
>
.C&KdCUrP÷S-z
add A
-
subtracts
"
1-
""
→ × , + xz -
s, + A. = 1500 f- Cia
< + add S sa left

↳
→ × , + ✗ 2+52--1500
+ add a →
×, + ✗ z+Az=isoo
s

A
minimized cost =

Young Cj 2) Row
-

most negative Cj -

Zj
Optimum column =

pivotal Rowe pinoikamababa quotient / Replacing Row

that M
* assume
number
Cj 50 10 75 M M 0 is a large

Prod Qty × , Xz Xz A , Az S ,
M ✗ 1000 =
1000M
Mx 2000 =
2000M
M A , 1000 I -

I 0 I 0 U Kase
yungnasa
o
0 ✗ 1500
0C

3000M
M Az 2000 0 2 2 0 I 0 1000 2000<=2

M ✗ I =
M
Kase O
0 S, 1500 I 0 0 O O l yung M ✗ 0=0
nasaoc

M M 2M M M p
0×1
=0_µ
2J 3000M
MX -
I = -
M

M ✗ 2 -12M

50 M O O O
Cj -2J 10 M -752M O ✗
0¥
-
-

↳ most negative value

to get the pivotal Row

* Divide qty of each row
→outgoing
outgoing variable Az Row
pivot
to the corresponding entry
-
=

entering
entering variable on the optimum column
-
. ✗3 - optimum column →
 Remaining Row :
Replacing ROW old entry (entry above / below pivot )( Replacing Row)
: -

As Row :
S , Row :
2000 :- 2--1000-1000-0110001=1000 1500-010003=1500
Cj 50 10 75 M M O
0=-2--0
2 :< 2=1
→

→
I -0101=1
-1 -0 (1) I = -
-010)
0-0117
:

=
I

0
2=-2--1 → O_O (1) 0 = 0 -011) = 0

Prod Qty ④ A Si 0 -2=0 I-0101--1 0-0107=0

: -
Xz ✗3 Az 0-01%7=0
1÷z=%→ 0-01%1=0
,

o÷2=o - p 010 ) =D
-
I -0103=1

Naft Mxlooo = 1000M

75000
42 75×1000 =

75 ✗ 3.1000 O l l 0 0 ×
0×1500=2
75000T 1000M
D S, 1500 I 0 0 0 0 I 1500 1500 :-|
M ✗ I = M
75×0=0
Lj Yf¥µ ,
M 75-1475 M ¥ 0 0×1
¥
Cj -2J 50 M -65+14
-

O O M
-

7¥ 0 A. ✗ -1 =
-

M
75×1 i 75
0×0
;¥m
option
10-1%5
:

M)

m.AE/-7z5-tM1O-75tM
-

-65 1- M

f-ltgoing variable -_
At

variable Xi
entering
:
 Replacing Row : Remaining ROW grow :

{/
1000 :- 1=1000 ✗3 :
1000-0110007--10001500-1110001=500
"
" " " " " ° I :-/ =/
" " "
0 -011 )
" ""
=D
"
I -114=0
" "" "
O :-| =D I -010) =/ 0-1101 :O

Prod Qty X Xz Xz A, Az Si ii. I =/ 0-0113=0

92-0101=1/2
0-1117=-1
0-1101=0
8¥ 8
,
,
0-0101=0 1-110) :
I

50 X, 1000 I -
I 0 I 0 0

• s , sooo , o , so. .am .

Zj 12500050 25 75 50 75-2 0

Cjizj 0 -15 0 M-50M -7¥ 0

outgoing variable :S,

entering variable :
X2
?⃝
 Replacing Row
: Remaining Row
✗ . Row : Xz ROW :

/
500 :-/ = 500 1000-1-171500) : 1500 1000-11715003=500
10 75 M M O
Cj 50 0=-1--0 I -1-1710 ) : I 0-111107=0
I :-| =
I I C- 1) ( c ) O l (1) (1) 0
-
- -
: =

0=-1 f- 1) ( O) D 111107=1
=
=
o o -

l -

Prod Qty ✗ , Xz Xz A, Az S, -1=-1 =

-1 1-(-171-1) :D 0-411-11=1
12 C) (D) Yz
'
0 :-| = O O -
1- 1) 10 ) :
o
-
=

15^00
-1
I :-( = I 0 C- 1) (1)
- = I 0 -

(c) (1) =

50 ×, I 0 O O O I

'
75 Xz 500 O O l l
Iz -
I

×. , , , ,

÷÷÷÷÷÷÷÷:÷
Maxi -

negative / omg
Cj Zj -

minimize

☒
Decision :
-

positive ung
¥:ÉÉ% fj -2J
?⃝
 course

°" """É""|
=

|
50 25 55 0

Desicion :

sweeney to o go is
assign
Williams 45 0 40 20
Anderson to Economics

Sweeney to statistics
McKinley 0 25 .
10 0
Williams to Management
McKinney to Finance
course
-

|
-

"""""""""°"""
|
Cost =
401-701-401-65=21-5

40 25 45 0

Elicanalfheryn Malo .

Sweeney 0 0 10 15
BSA 1-2
Williams 35 30 20

McKinley 0 35 .
10 10

course

;ti|t=iimig
-

Anderson 40 25 45 0

Sweeney 10 15

Williams 35 30 20

McKinley 0 35 .
0 10

ASSIGNMENT METHOD
* HUNGARIAN NHIÉTTHOD
?⃝
2.

80 -

let :
✗ = no .
OF audits
-

D= no .

OF tax returns
7s
-

Objective Function :

70
_•••y(
-
0,72)

Maximizing -2=2000×1-3004
-

subject to
constraints 100×+12.54<-900 65
-

10×1-259=100
-

60 -

100×1-12.54=900 10×1-2.54=100
-

10011--900 55 -

1011=100
✗ =9 10
-

✗ =

( 9,0 ) 110,01 50 -

100×1-12 .5y -900 10×1-2 .5y -100

-
-

45
12.54=900 2.5g =/ 00
-

9=72 y=4o
-

elimination method .

( 0,72 ) ( 0,40) 40010.407

100×1-12.54=900 2=2000×1-3004 -

10110×1-2.59=100710 (0,7-2)
2=200010/1-300140) -

☒ 1- 12.59=900 =
Of 12000 30 -

1/00×1-254=10,000 -1¥
-

-42.5g =
-100 É
( g. ,
4=1,00-2.5 2=20001811-300181
=
160001-2400 20
y=q
-

=
18,400
19,0T
100×1-12.54=900 2=20001911-300107
100×-112.5187=900 e-
18000 to 10 -

• (8,8)
www.aoo-i#
10011=900-100
10/011=800 Decision
;•%• .io#..:......:.;..:..i.i:oi:-si:i:-':o':-
:
' '

•
☒ TOO •
• •
In order to maximize Revenue the , accounting Firm
✗ = 8 needs :

( 8. 8) ✗ =8 audits
8 tax returns
y :

which will result to a revenue of :# 18,400