0% found this document useful (0 votes)
36 views20 pages

HTT Final: D Attendance Exam Final Simplex Book Transportation Pay Your Dark Type I II

1. The document provides information for a final exam, including details about the exam such as date, time, duration, and topics that will be covered. 2. Revision guides are provided for the exam topics, including formulation, graphical method, and simplex method. Students are advised to work through examples and write personal notes for each topic. 3. Tips are given to help students prepare and take the exam, such as having a stable internet connection, bringing supplies, managing time well, and keeping work clear and organized. Students are encouraged not to panic and to ask for help if needed.

Uploaded by

Mohamed Ahmed
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
0% found this document useful (0 votes)
36 views20 pages

HTT Final: D Attendance Exam Final Simplex Book Transportation Pay Your Dark Type I II

1. The document provides information for a final exam, including details about the exam such as date, time, duration, and topics that will be covered. 2. Revision guides are provided for the exam topics, including formulation, graphical method, and simplex method. Students are advised to work through examples and write personal notes for each topic. 3. Tips are given to help students prepare and take the exam, such as having a stable internet connection, bringing supplies, managing time well, and keeping work clear and organized. Students are encouraged not to panic and to ask for help if needed.

Uploaded by

Mohamed Ahmed
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/ 20

It 65 F

htt Sunday 3111 2021


D Attendance
Final Exam
Final examcontents Cdo points
Formulation 1 Date 11Feb Thu
Graphical Method 1 Time i 7 00 PM
simplexMethod Duration 2 Hours
Simplex Big M Type i onlinelopen book
Transportation model I 2
ConditionalPay offtables I 2
6 8 Questions
General Requirements
Good and stable internet connection
14 sheets of whitepaper your name on each at the topright corner
Question at the topleft corner
pages of in the top center
Itleave blank untilfullydone
Dark blue or black pen or type B pencil
Proper light for shooting of your work
A smile e

a Revision Part I
Revision Part II
Final Exam preparations
Remember X A goodsettes to follow can make
a
huge difference
A set of steps was provided
steps for each topic A summary will
be revision
provided again in the
Solved problems A good and clearlysolved
problem for each topic helps
a lot in
the guiding you through
steps
Your personal comments notes As you
work way through the different
your
write comments and explanations
topics own words
using your
Do not PANIC
Use the exam time wisely
Clear and work makes it easier for
tidy
me to find mistakes that should not
be counted against Help me to help
you
you
Values that are allowed to
go negative

xi
xi xi 3 o

x to
X to IS S
X is

X Xz X

Mixed
Integer
Revision Part I
Formulation problem
A chocolate company wishes to determine the number of
units to produce of types A B and C such that the total net
profits are The following table provides information
on the net maximized
unit and the cost of
profit per production
A B C
Netprofittunit 4 6 a
lost limit 5 9 12

Milk and Choco is used to produce the three chocolate


types as
shown in the following table
A B C Available
Milk 3 2 4 3000
Choco 1 3 2000

Total daily production must not be less than 800 chocolatebars


Total productioncost available is 19.000
Formulate the mathematical model of this LPP
X of units produced of Type A Steps Formulation
Definethedecisionvariables
Xz E x x x x x x B FormulatetheobjectivefunctionMayfair
37LFormulatethefunctionalconstraints

Xz I x x x x x x C 47LAddtheNon Negativityconstraints

Max 2 4X 16 2 9 3
St 3X 12 2 4 3 E 3000 Milk
Xz 13 3 2000 Choco
Xi t k t Xz 3 800 Daily production req
S Xi t 9 2 t 12
Xz f 10,000 Budgetlimitation
Xl Xz 1 3 30
1
Graphical Method Page of
Find the optimal solution of the following LPP using the Graphical
Method
Min Z 2X 14 2 Steps Graphical Method
St constraints
Represent graphically
X 1Xz 3 10 IdentifyAFS
45 X 2390030 IdentifytoNamethecornersof Ats
SOX 45 23900 30 8 2 Calculate of
coordinates a a AFS
ofmaAFsofaftnhejbjectiret
Y Ees e i ga ftp.a.qgzrner.sp
Xz 25 25 30
X Xz So

t
a
2 4 f d e

12,127 72
AFS
b Gs 1
7 63430
20

C
GS 25 150 A a
di 10
3,25 106.93
lo

p e
so ff
go
f lo 20 30 X
T q
scratches of

point a t

45 11 30 2 900
30 11 45 2 900 too IS

simplify 10 25
15 1 t 10 2 300
10X IS Xz 300 121
IS

2 73
3
20 10X 11 0
12 200
10 15
30 2

231Xz 100

8.4
1
112 10 12

45 1 1 30421 900
4
45 1 540
541
121
44

O
Page f
a
I E I

Point bi t

30 X 4542 900
XII
30 Lz5 45 2 900
451 2 150

Xz
3,30110 I
Simplex
construct the initial plusonesimplex tableaux for the following LPP
Max Z 4X 2 21 2 3 Steps Simplex Transformation
St
X 1 Xz 1 Construct the initialsimplextab
Xz 1000
Read Var Z OT
2 Xz 400 Column
Identify Pivot
13 3
is a Row
Calculatethe nextsimplextab
X
ZO
Max Z 4X 2 21 2 3
St
Xl f Xz t Xz IS 1000
2 2 13 3 52 400
Xi Xz Xz 04,5230
2 O
4 2 O
BU X Xz Xss Sz RHS X o S 1000

Sz O 2
2 4 2
3
2
0

O O
I 400
O
X3
II
X 2000 S O
X l l l l 0 1000 Xz O 52 400
Sz O 2 3 0 I 400 113 0
2 4000 OT Optimal
2 0 6 2 4 O 4000

Note If tab is Not optimal you must identify


the pivotcolumn to pivot Row
BV X Xz x S S RHS

2
I

Differences between Max Min

loefficien of A PivotColumn optimaily Test


in 2

Max M most ve no revalues


value'lnZ inz

most ve
Min M value inZ notveralues
in 2
simplex BigM
Construct the initial simplextableau for the following LPP
Max 2 4X 1 21 2 3
st Steps Simplex M
X 12 2 400 1 3
Transformation Big
Xz 1 243 3100 karts s1A A
3 Xz 300
Xz 200
in z Max M Min
Construct the initialsimplextab
TM
Xl
Xl Xz Xz 30 Read Var Z OT FT
Identify PivotColumn
2 3
gfflax
2 4X 1 2 MAI MAZ qgcakfiatethenexRFI.inplextab
X 12 2 1 Xz 1S 400

Xz 1213 Sz 111 100

3Xz Xz 112 300

Xl 153 200

Xi Xz Xz Oj 5,835330J A 30

4 I 2 O o o M M
BV x Xz Xz S Sz S3 At Az RHS x o z 400M
S I 2 I 1 O O O 0 400 Xz
0 0T NO
3
M t
000O si 400 FeasibilityTest
52 0 NotFeasible
n

io
Z 4 f l 2000Mth
E
E T TE JE O E O O 0
go
Revision Part
Transportation Problem
Construct the initial plusone transportation solutions
I 2 3
I 4 2 Steps Transportation
1 100 Balance the problem
NWMethodto calculatethe
initialbasicfeasiblesolution
3 I 1 tables
2 100 CalculateTotal lost
TestsBasic Feasible
Evaluateemptycells
2 3 If optimal Exit
3 7 100 DeterminesSC AVNTC
Calculatethenextsolution

120 80 80 Supply 300


Demand 280 column

l 2 3 4
I 4 2 O
100 Not optimal
100
se 2,3
3 I I t 0
z
100
Aye 80
20 80
NTC 800 4180
Z 3 t 7 o
3 100 5480
ZERO 80 20

20 800
120 80 80
I 2 3 4 Basic
I 4 2 O
100 Not optimal
100
3 I l t
SC 3,1
o
z
20 80 100 AV ZERO
20 80 A 10

2 43 7 o NTC 480
3 100
80 ZERO 20

120 80 80 20 480
I 2 3 4 Basic
I 4 2 O
100
100
3 I I 0
z
20 100
80
2 3
3 7 100
80 ZERO 20

120 80 80 20 480
l 2 3 4
72L
I 4 2 0
I 100

3 I I 0
z
100

2 3 7
3 100

80 20
120 80
I 2 3 4
I 4 2 0
I 100

3 I I 0
z
100

2 3 7
3 100

80 20
120 80
Conditional Pay off

A bakery shop sells cakes


during the day at 120 and
nets 40 Unsold cakes at the end of the sold
day are

half priced to a nearby supermarket with a shippingcost


of 10 per cake The expected cost of losing a customer
is determined to be 5 of shortage
per unit
Construct the conditional Pay off formulae
ConditionalPayoff Tables
Steps
Determine thevalues PC of ie l X
P 120 Selling Price calculate netprofit Pe
p net costofsurplus
limit Cti e
12040 C 80 lost finiteHELPc
cost ofshortage te
Constructthetwocasesformulae Do
Notsimplify
l I0 lost of getting ridof theconditionalPayofftableinsgthensquare
Calculate
UnsoldUnits theexpectedCPOTable
calculate
E
60 Sellingpriceendofperiod Determine Qthat
givesthemaximumexpectedCPO

l 5 of losing a
Expectedcost constructingFormulaefromthetables
customer I calculatetheNetprofit Anyvalueonthediagonal
X I 1 costof shortage correspondingDvalue

o otherwise of
Calculatecost surplus
finite
acellonthediagonalandanycelltotheright
twocorresponding Qvalues
of
Calculatecost shortage
finite
acellonthediagonalandanycellbelow it
Net Profit PC 120 80 40 atwocorrespondingDrakes
constructthetwoformulae
c CPO EID QD

Cost of surplus lunite Cti e cg iceo a uson

801 10 60 30
x x
shortage Innit X CP Dtl
120 80 15
45
i
S

CPO LP C D K i e CQ D
3,1
CPO LED Q X CRC l D Q
q

How to Determine X
clearly stated take the cost of shortage in
consideration XI
Do not take it in consideration o

Competition Verystrong competition txt


Is a strong competitor X o

Expected cost of losing a customer is given xD

Nothing is mentioned with reference to shortage cost


or competition Default x D
Conditional Pay off Tables
Q
Q
20 22 24 26

20 800 620 186


22 880820 7600.20000
D
24 9609000

26 700 1040 416

656 757 812


1.0
Qc Construct the CPO formulae
Qa Optimal Q value provides the highestexpected
CPO

Q1 CPO D Q D
CEI
Q LD Q
YET cpo
a Net profit
b cost of surplus unit

c is a
shortageInnit
Deadline for WhatsApp Questions

is 9 00 PM Tuesday

9 2 2021

You might also like