question 1

beauty
cloth
labr
handle
profit/unit
qty

mighty
3
4
0
20
5

result
5
1
1
30
4

available
35
24
4
220

35
24
5

question 2
tables
wood
profit/unit
qty

chairs
4
40
24

result

availability
240
240
2160
48

result

availability
7
240
65
2

3
25
48

question 2
tables
wood
profit/unit
qty

chairs
4
40
1

3
25
1

0
0
0
0
0

0
0
0
0
0

question 2.2
product
tv
stain remover
liq det
powder det
unit cost
qty

print
0
3
-1
1000000
4

increase in sales achieved

1
2
4
2000000
3

3
18
8
10000000

min reqd increase

3
18
4

frame1
labour
metal
glass
price
cost
profit
qty
demand max

2
4
6
28.5
22.5
6
1000
1000

frame2
1
2
2
12.5
10.5
2
800
2000

frame3
3
1
1
29.25
25.25
4
400
500

frame4
2
2
2
21.5
18.5
3
0
1000

cost
8
0.5
0.75

resources avaialble
4000
6000
10000

result
4000
6000
8000
50200
41000
9200
1800000

performance rating

adams
brooks
carter
darwin

assignment case
divorce
corporate
6
9
4
6

adams
brooks
carter
darwin

0
0
0
1
1
total score

exhibitionism
8
5
5
8
3
4
6
4

embbezz

exhibitionism
1
0
0
1
0
0
0
0
1
1
30

2
3
8
7

assign
corporate

divorce

embbezz

0
0
1
0
1

1
1
1
1

school

happy kids school

bandra
sai
ali
soni
kittu

versova
5
6
4
5.5

goregaon
3
4
3.5
3.5

ghatkopar
6
100
7
6

9
7
10
8

goregaon kids do not want ali

school policy max 2 routes to one contractor
finalise the contract
bandra
sai
ali
soni
kittu

versova
0
0
1
0
1

total

goregaon
1
0
0
0
1
20

ghatkopar
1
0
0
0
1

0
1
0
0
1

andheri

2
1
1
0

bids to run bus

plant supplies
city 1
plant 1
plant 2
plant 3
demand

cost of production distribution/unit

city 2
city 3
city 4
8
6
10
9
12
13
14
9
16
45
20
30
125

city 1
plant 1
plant 2
plant 3

city 2
0
45
0
45

total cost

city 3
10
0
10
20

1020

capacity
9
7
5
30

35
50
40

0
0
30
30

35
50
40

city 4
25
5
0
30

125

oil refinery
bpcl
depo2

depo1
refinery 1
refinery 2
refinery 3
demand

20
22
18
900

depo3
12
15
18
500

15
7
6
400

total deman
q1
q2
q3

total

8
13
9
700

2500

find optimum distribution schedule

the pipe line from 3 to 3 depo is disrupted, what is the revised tra
there is a strike 2 days, capacity org ref is now 1000, revise soluti

depo1
refinery 1
refinery 2
refinery 3
demand

depo4

depo2
0
0
900
900

31400

depo3
400
100
0
500

depo4
0
400
0
400

200
0
500
700

prod (refining cost)+transportation/ton

capacity
600
1000
3000
1400

t is the revised transportation plan

1000, revise solution

capacity
600
500
1400

Microsoft Excel 14.4 Sensitivity Report

Worksheet: [decision science.xlsx]Sensitivity problem

Variable Cells
Cell
Name
$B$7 qty Table
$C$7 qty chair
$D$7 qty sofa

Final
Reduced
Objective
Value
Cost
Coefficient
10
0
120
8
0
75
0 -40.384615385
200

Allowable
Increase
60
105
40.3846153846

Constraints
Cell
Name
$E$3 wood result
$E$4 labor result
$E$5 polish result

Final
Shadow
Constraint
Allowable
Value
Price
R.H. Side
Increase
160 8.0769230769
160
104
132 3.8461538462
132
52
70
0
100 1.0000000E+030

Allowable
Decrease
18
25
1.00000E+030

Allowable resource new

sofa
Decrease
86.666666667
2
25
52
3
10
30
5
8
27.69230769 240.3846154

Table
wood
labor
polish
profit/unit
qty

chair
12
6
3
120
10

sofa
5
9
5
75
8

result
25
10
8
200
0

160
132
70
1800

avaialble
160
132
100

Microsoft Excel 14.4 Sensitivity Report

Worksheet: [decision science.xlsx]sens hospital

Variable Cells
Cell
$B$16
$C$16
$D$16
$E$16

Name
qty cereals
qty veg
qty fruits
qty milk

Final
Value
0.0
3.7
0.0
0.2

Reduced
Objective
Cost
Coefficient
12.5
40.0
0.0
30.0
15.8
50.0
0.0
20.0

Constraints
Cell
$F$11
$F$12
$F$13
$F$14

Name
carb result
prot result
min result
fib result

Final
Value

Shadow
Price
80.0
79.2
75.8
75.0

0.4
0.0
0.0
1.1

Constraint
R.H. Side
80.0
50.0
30.0
75.0

Allowable
Increase
1000000000000000000000000000000.0
17.3
1000000000000000000000000000000.0
12.5

Allowable
Increase
445.0
29.2
45.8
5.0

Allowable
Decrease
12.5
18.6
15.8
12.5

Allowable
Decrease
5.0
1000000000000000000000000000000.0
1000000000000000000000000000000.0
55.0

sensitivity hospital problem (blending)

cereals
carb
prot
min
fib
price/init
qty

veg
40.0
10.0
5.0
10.0
40.0
0.0

fruits
20.0
20.0
20.0
20.0
30.0
3.7

milk
30.0
25.0
25.0
20.0
50.0
0.0

35.0
30.0
10.0
5.0
20.0
0.2

result

ava
80.0
79.2
75.8
75.0
114.6
13.8

80
50
30
75

network model
flow capacity
cost/ton
constraint
2000
30
1700
30
1600
50
1100
50
400
70
800
70

from
m1
m1
m2
m2
s1
s2

to
s1
s2
s1
s2
p
p

node
m1
m2
s1
s2
p

flow equations
from
to
0
0
40
40
0

net out
0
0
40
40
40

0
0
0
0
-40

flow optimisation
qty or flow
0
0
0
0
40
40

cost

should be
<=
<=
equals to

40
60
0
0
-100

48000

from
la
la
sd
sd
dal
dal
hos
hos

to
dal
hos
dal
hos
ny
chic
ny
chic

cost

node
la
sd
dal
hos
chic
ny

from

to

cost
300
110
420
100
450
550
470
530

2
2
2
2
0
0

0
0
2
2
2
2

total
0
0
0
0
700
700
900
900

2930

qty

out
1
1
1
1
1
1
1
1

3
4
3
4

cargo problem

node
ny
pb
ind
chic
mp
la
dal

from
ny
ny
ny
ny
pb
pb
ind
ind
chic
chic
mp
dal

to
pb
ind
chic
dal
ind
mp
chic
la
mp
la
la
la

from

to
4
2
2
2
1
0
1

capacity

qty
10
11
3
3
2
8
10
2
4
8
7
13

1
1
1
1
1
1
1
1
1
1
1
1

non linear programming

if problem has multiple maxima and minima solver cannot solve it
solver calculates program wrt newtons gradient
for such problems where solver does not work
use prime solver or evolutionary solver which works on genetical algorithm
Reliance fresh
city
delhi
kolkota
chennai
mumbai
ahmedabad
bengaluru
warehouse

location model
x
y
demand
-1
12
70
7
8
80
4
2
90
-5
7
100
-6
10
50
1
-2
40
-0.8103327 6.867727792

tical algorithm

distance
to km
5.135775667
7.891979299
6.843542544
4.191754766
6.061664446
9.05062985
39.17534657

Factory
F1
F2
F3
Demand
price
pro

c1

Factory
F1
F2
F3
Demand

c1

transportion cost
selling
prod
profit

c2
3
4
1
200
13

c3
4
2
3
350
14

c2
0
0
200
200
2700
15450
6350
6400

c4
3
3
2
450
11

c3
0
350
0
350

5
3
4
250
12

c4
150
0
300
450

0
250
0
250

cap.
300
600
500

cap.

production cost
150
5
600
6
500
4

Bin
Frequency
-491992
1
-164743
2
162505.5
3
More
5

Histogram
Frequency

6
4
2
0

Freque

Bin

ram
Frequency

prob
0.2
0.3
0.25
0.15
0.1

cumulativedemand
0
6000
0.2
7000
0.5
8000
0.75
9000
0.9
10000

profit
Q(price-vc)-fc
Demand varible cosprice
profit
8000 154.0511 260.6716 -247036
10000 129.6523 335.035 953827.1
7000 166.2762 335.4456 84185.48
7000 150.674 323.9466 112908.4
6000 152.4006 306.9811 -172517
7000 141.6848 295.8559 -20802.78
7000 162.4538 318.4915 -7736.403
9000 166.6596 263.3115 -230133
8000 161.026 282.5471 -127832
6000 147.0201 370.1507 238783.6
6000 154.9833 309.7758 -171245
37491.2

prob.

7
0.636364

cumulativepassengers
0
0
0.05
1
0.15
2
0.3
3
0.5
4
0.65
5
0.75
6
0.83
7
0.88
8
0.93
9
0.98
10
lonwala papss
3
1
0
1
4
1
1
3
1
4
5
10
10
3
2
0
1
2
3
7
3
5
3
8
3
5
2
5
3

max passelonawala pssng

42
42
200
53
50
5000
35
35
-4000
43
43
800
43
43
800
39
39
-1600
54
50
5000
47
47
3200
46
46
2600
46
46
2600
43
43
800
53
50
5000
40
40
-1000
49
49
4400
40
40
-1000
41
41
-400
46
46
2600
37
37
-2800
41
41
-400
37
37
-2800
50
50
5000
48
48
3800
38
38
-2200
45
45
2000
40
40
-1000
51
50
5000
50
50
5000
43
43
800
34
34
-4600

42

42
0

200
1100

from
NY
NY
NY
NY
PT
PT
IN
IN
CH
CH
MI
DA

to
PT
IN
CH
DA
IN
MI
CH
LA
MI
LA
LA
LA

Capa

Node
NY
PT
IN
CH
MI
DA
LA

from

to

qty
10
11
3
3
2
8
10
2
4
8
7
13

20
7
10
8
7
3
0

7
10
0
3
0
7
8
2
0
8
7
3

net
0
7
10
8
7
3
20

-20
-2.8137E-012
-3.6060E-013
1.97353E-012
-1.4655E-013
0
20