Addis Ababa University

Addis Ababa institute of technology

School of Civil and Environmental Engineering

Construction technology and Management

System Analysis and Management Techniques-1 (CENG-6103)

FINAL COURSE ASSIGMENT

Submitted by: Andualem Tadesse MENGSTU

Submitted to: Abraham Assefa (PHD)

February 2021

Final Course Assigment

Andualem MENGISTU1
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

1
MSc Student AAiT, School of Civil and environmental engineering, Construction
technology and management. Addis Ababa University, Addis Ababa Ethiopia;
ID: GSR/ 3901/13; PH (+251) 911-278-945; email: andu117@gmail.com

Q-1
a. Given I1=4, I2=6, I3=8, and I4=18 required.

Voltage drop across each resister must be between 2 and 10 volts

Facts: V1 = V2 = V3 and I1+ I2 + I3 = I4,

The power dissipated by the current flowing through resister t =I2tRt

Choose Rt to minimize the total dissipated power

Objective function Za,

Minimize Z= I21R1 + I22R2+ I23R3+ I24R4

42 R1 + 62 R2 + 82 R3 + 182 R4

16 R1 + 36 R2 + 64R3 + 324 R4

Subjected To: V1 = V2 = V3 => I1R1 = I2R2 = I3R3

4R1 = 6R2 = 8R3

2 ≤ 4R1 ≤ 10,

2 ≤ 6R2 ≤ 10,

2 ≤ 8R3 ≤ 10,

2 ≤ 18R4 ≤ 10,

R1 ≥ 0, R2 ≥ 0, R3 ≥ 0, (Non Negativity Constraint)

1|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Fig 1 solver solutions for a.

b. Given that: V1 = V2 = V3 =6 and V4= 4 is required. The current flowing to

each resister must be between 2 and 6 amperes. Choose Rts to minimize
the total dissipated pawer.

Objective function Zb
4 4
V 2t
Zb =∑ I 2t R t = ∑ Rt
t =1 t =1 R2t
3
36 16
=∑ +
t =1 Rt R 4

Therefore, the objective function will be Zb,

1 1 1 1
Zb = 36( + + )+
R1 R2 R3 R 4

6
Subject to: 2 ≤ ≤ 6, t ϵ {1 , 2 ,3 } ,
R1

6
2 ≤ ≤6
R2

6
2≤ ≤6
R3

4
2 ≤ ≤6
R4

R1 ≥ 0, R2 ≥ 0, R3 ≥ 0 Non-negativity Constraints.

2|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Fig Solver Results for b.

Q2.
Use Simplex Algorism to solve the following LP Problem:

Maz Z=2x1-x2++x3

Subject To: 3x1+x2+x3 ≤ 60

2x1+x2+2x3 ≤ 20

2x1+2x2+x3 ≤ 20

x1, x2, x3 ≥ 0 non negative constraint

Chenge the GLPP to SLPP

Min Z=2x1-x2+x3+0s1+0s2+0s3

Subject to

3x1+x2+x3+s1=60

2x1+x2+2x3+s2=20

2x1+2x2+x3+s3=20

Developing simplex table and doing iterations

Cj 2 -1 1 0 0 0
Basic
Variable CB XB x1 x2 x3 s1 s2 s3    

s1 0 60 3 1 1 1 0 0 60/3=20  
s2 0 20 2 1 2 0 1 0 20/2=10 leaving
2
s3 0 20 2 2 1 0 0 1 20/2=10  

3|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

                     
  Z=CB*XB 0 -2 1 -1 0 0 0    
R1=R1-3R2
- -1
s1 0 30 0 1/2 -2 1 1/2 0    
x1 2 10 1 1/2 1 0 1/2 0    
s3 0 20 0 1 -1 0 -1 1    
      R3=R3-2R2            
  Z=CB*XB 20 0 2 1 0 1 0    
Since all Δj ≥ 0, optimal basic feasible solution is obtained Therefore the
solution is Max Z = 20, x1 = 10 and x2 = 0, x3 = 0

Q3.
To($)
From NE NW MW SE SW
Los Angeles 27.86 4 20.54 21.52 13.87
Chicago 8.02 20.54 2 6.74 10.67
New York 2 27.86 8.02 8.41 15.2
Options
Atlanta 8.41 21.52 6.74 3 7.89
Houston 15.2 13.87 1067 7.89 3

Let cij cost of supplying from supply point i to demand point j,

xij amount of capacitors supplied from supply point i to demand point j

Min
Z=27.86X11+4X12+20.54X13+21.53X14+13.87X15+8.02X21+20.54
X22+2X23+6.74X24+10.67X25+2X31+27.86X32+8.02X33+8.41X34+1
5.2X35

s.t. X11+X12+X13+X14+X15=100,000

X21+X22+X23+X24+X25=100,000

X32+X32+X33+X34+X35=100,000

X11+X21+X31=55,000

X12+X22+X32=50,000

X13+X23+X33=60,000

4|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

X14+X24+X34=60,000

X1+X25+X35=45,000

X11, X12, X13, X14, X15, X21, X22, X23, X24, X25, X31, X32, X33, X34, X35 ≥ 0

We must covert the annual costs over an infinite time period in to present values
since discount rate is 0.12 an infinite sequence of infinite costs of 1$/year is
equivalent to a present value of 1/0.12=$8.33

Case1: Without Adding Plants

With Vogel’s method we find a besic feasible solution (bfs)

Step 1
NE NW MW SE SW Dummy Supply Penality
LA 27.86 4 20.54 21.52 13.87 0 50,000 4
50,000
Chicago 8.02 20.54 2 6.74 10.67 0 100,000 2

NY 2 27.86 8.02 8.41 15.2 0 100,000 2

Demand 55,000 50,000 60,000 60,000 45,000 30,000

Penality 6.02 16.54 6.02 1.67 3.2 0

Step 2
NE NW MW SE SW Dummy Supply Penality
LA 27.86 20.54 21.52 13.87 20,000 13.87
50,000 30,000
Chicago 8.02 2 6.74 10.67 100,000 4.74

NY 2 8.02 8.41 15.2 100,000 6.02

Demand 55,000 X 60,000 60,000 45,000 X

Penality 6.02 - 6.02 1.67 3.2 -

Step 3

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 20,000 30,000
Chicago 8.02 2 6.74 10.67 100,000 4.74

NY 2 8.02 8.41 15.2 100,000 6.02

Demand 55,000 X 60,000 60,000 25,000 X

Penality 6.02 - 6.02 1.67 4.53 -

Step 4

5|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 20,000 30,000
Chicago 2 6.74 10.67 100,000 4.74

NY 8.02 8.41 15.2 45,000 0.39

55,000
Demand X X 60,000 60,000 25,000 X
Penality - - 6.02 1.67 4.53 -

Step 5

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 20,000 30,000
Chicago 6.74 10.67 100,000 4.74
60,000
NY 8.41 15.2 45,000 6.79
55,000
Demand X X X 60,000 25,000 X
Penality - - - 1.67 4.53 -

Step 6

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 20,000 30,000
Chicago 6.74 10.67 100,000 4.74
60,000
NY X -
55,000 45,000
Demand X X X 15,000 25,000 X
Penality - - - 1.67 4.53 -

Step 7

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 20,000 30,000
Chicago 6.74 10.67 X -
60,000 15000 25000
NY X -
55,000 45,000
Demand X X X X X X
Penality - - - - - -

6|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Vogel’s method yields in initial bfs

X12 =50,000, X15 = 20,000, X16 =30,000, X23 = 6,000, X24 = 15,000, X25+25,000,
X31 =55,000, X34 =45,000 and X11= X13= X14= X21= X22= X26= X32= X33= X35= X36= 0

We must find ui and vj by solving:(ui+vj= cij and ui =0)

u1+v2 = c12 =4  v2 =4
u1+v5 = c15= 13.87  v5=13.87
u1+v6= c16= 0  v5=0
u2+v3 = c23= 2  v3=5.2
u1+v4 = c24= 6.74  v5=9.74
u2+v5= c25= 10.67  u2= -3.2
u3+v1 = c31= 2  v1=3.53
u3+v4 = c34= 8.41  u3=-1.53
Pricing out the non basic variable
C 11=u1+v1-c11 = 0+ 3.53-27.86 < 0
C 13= u1+v3-c13 = 0+ 5.2-20.54 < 0
C 14= u1+v4-c14 = 0+ 9.94-21.52 < 0
C 21= u1+v1-c21 = -3.2+3.53-8.02 < 0
C 22= u2+v2-c22 = -3.2+ 4-20.54 < 0
C 26= u2+v6-c26 = -3.2 + 0.0 - 0.0 < 0
C 36= u3+v6-c36 = -1.53+ 0.0- 0.0 < 0
C 35= u3+v5-c35 = -1.53+ 13.87-15.2 < 0
C 33= u3+v3-c33 = -1.53 + 5.2- 8.02 < 0
C 32= u3+v2-c32 = -1.52+ 4-27.86 < 0
Since all the costs are negative, the initial basic feasible solution is optimal
Cost = 4x50,000 + 13.87x20,000 + 0*30,000 + 2x60,000 + 6.74*15,000 +
10.67x25,000 + 2x55,000 + 8.41x45,000= $1,453,700
Present Value = Production and shipping cost =8.33x$1,453,700 = $12,109,321
Operation cost= 8.33x3x50,000= $1,249,500
Construction cost= 0
Total Present Value=$12,109,321 +$1,249,500+0= $13,358,821

Case2: Adding Houston Only

7|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Vogels’s method yields the following

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 50,000
Chicago X -
35,000 60,000 5,000
NY X -
20,000 80,000
Houston X -
0 55,000 45,000
Demand X X X X X X
Penality - - - - - -
The Initial bfs
X12 =50,000, X16 = 50,000, X21 =35,000, X23 = 60,000, X24 = 5,000, X31+20,000,
X36 =80,000, X44 =55,000, X45 =45,000 and X11= X13= X14= X15 = X22= X25= X26= X32=
X33= X34= X35= X41= X42= X43= X36 = 0

Pricing out the basic Variable( u1=0)

u1+v2 = c12 =4  v2 =4
u1+v6 = c16= 0  v6=0
u2+v1= c21 = 8.02  u2 =6.02
u2+v3 = c23= 2  v3=4.0.2
u1+v4 = c24= 6.74  v4=0.72
u3+v1= c31= 2  v2= 2
u3+v6 = c36= 0  u3=0
u4+v4 = c44= 7.89  u4=7.77
u4+v5 = c45= 3  u3= - 4.77

Pricing out the non basic variable

C 11=u1+v1-c11 = 0+ 2 -27.86 < 0
C 13= u1+v3-c13 = 0+ 4.02-20.54 < 0
C 14= u1+v4-c14 = 0+ 7.77-21.52 < 0
C 15= u1+v5-c15 = 0- 4.77-13.87 < 0
C 22= u2+v2-c22 = 6.02+ 4-20.54 < 0
C 25= u2+v5-c25 = 6.02- 4.77-10.67 < 0
C 26= u2+v6-c26 = 6.02 + 0.0 - 0.0 < 0

8|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

C 32= u3+v2-c32 = 0.0+ 4- 27.86 < 0

C 33= u3+v3-c33 = 0.0+ 4.02- 8.02 < 0
C 34= u3+v4-c34 = 0.0+ 0.72- 8.47 < 0
C 35= u3+v5-c35 = 0- 4.77-15.2 < 0
C 41= u4+v1-c41 = 7.77 + 2.0 – 15.2 < 0
C 42= u4+v3-c42 = 7.77 + 4.0 – 13.87 < 0
C 43= u4+v3-c43 = 7.77 -4.02 – 10.67 < 0
C 46= u4+v6-c46 = 7.77 +0.0 – 0.0 > 0
Since C 46> the initial basic Feasible solution is not Optimal Also X46 will enter
the basis.
The Loop Involving X46 will be then:
E O E O E O
(4,6) (3,6) (3,1) (2,1) (2,4) (4,4)
The Odd cell with the lowest value is (2, 1), which mean X21 will leave the basis

NE NW MW SE SW Dummy
L.A 50,000.00 50,000
Chicago (35,000-35,000) 60,000.00 (5,000+35,000)
N.Y (20,000+35,000) (80,000-35,000)
Houston (55,000-35,000) 45,000 (0+35,000)
Pricing out the basic variables

u1+v2 = c12 =4  v2 =4
u1+v6 = c16= 0  v6=0
u2+v3 = c23= 2  v3=3.15
u1+v4 = c24= 6.74  v2=-1.15
u3+v1= c31= 2  v2= 2
u3+v6 = c36 = 0  u3=0
u4+v4 = c44= 7.89  u4=7.89
u4+v5 = c45= 3  u3= 3
u4+v6 = c21= 0  u4= 0
Now Pricing out the non basic Variable
C 11=u1+v1-c11 = 0+ 2 -27.86 < 0

9|P a g e SEMISTER ASSIGNMENT

SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

C 13= u1+v3-c13 = 0+ 3.15-20.54 < 0

C 14= u1+v4-c14 = 0+ 7.89-21.52 < 0
C 15= u1+v5-c15 = 0+3-13.87 < 0
C 21= u2+v1-c21 = -1.15+ 2-8..02 < 0
C 22= u2+v2-c22 = -1.15+ 4-20.54 < 0
C 25= u2+v5-c25 = -1.15+ 3 -10.67 < 0
C 26= u2+v6-c26 = -1.15 + 0.0 - 0.0 < 0
C 32= u3+v2-c32 = 0.0+ 4- 27.86 < 0
C 33= u3+v3-c33 = 0.0+ 3.15- 8.02 < 0
C 34= u3+v4-c34 = 0.0+ 7.89- 8.47 < 0
C 35= u3+v5-c35 = 0- 3-15.2 < 0
C 41= u4+v1-c41 =0 + 2.0 – 15.2 < 0
C 42= u4+v3-c42 = 0 + 4.0 – 13.87 < 0
C 43= u4+v3-c43 = 3.15 -4.02 – 10.67 < 0
Since all of them are negative the solution is optimal

Cost = 4x50,000 + 0x50,000 + 2x60,000 + 6.74*40,000 + 2x55,000 + 0x45,000

+ 7.89x20,000 +3x45,000 + 0x35,000 = $992,400
Present Value =
Production and Shipping Cost=8.33x992,400= $8,266,692
Operation costs of Plants = 8.33x4*50,000 = $1,666,000
Construction Cost: $3,000,000
Total Present =$12,932,692

Case3: Adding Atlanta Only

Vogels’s method yields the following

10 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

NE NW MW SE SW Dummy Supply Penality

LA X -
50,000 50,000
Chicago X -
60,000 5,000 35,000
NY X -
55,000 45,000
Atlanta X -
60,000 40,000
Demand X X X X X X
Penality - - - - - -

The Initial bfs

X12 =50,000, X16 = 50,000, X23 =60,000, X25 = 5,000, X26 = 35,000, X31+55,000,
X36 =45,000, X44 =60,000, X45 =40,000 and X11= X13= X14= X15 = X21= X22= X24= X32=
X33= X34= X35= X41= X42= X43= X36 = 0

Pricing out the basic Variable (u1=0)

u1+v2 = c12 =4  v2 =4
u1+v6 = c16= 0  v6=0
u2+v3= c23 = 2  u3 = 2
u2+v5 = c25 = 10.67  v5=10.67
u1+v6 = c26 = 0  u2= 0
u3+v1= c31 = 2  v1= 2
u3+v6 = c36 = 0  u3=0
u4+v4 = c44 = 3  u4= -5.78
u4+v5 = c45 = 7.89  u4= - 2.78

Pricing out the non-basic variable

C 11=u1+v1-c11 = 0+ 2 -27.86 < 0
C 13= u1+v3-c13 = 0+ 2-20.54 < 0
C 14= u1+v4-c14 = 0+ 5.78-21.52 < 0
C 15= u1+v5-c15 = 0- 10.67-13.87 < 0
C 21= u2+v1-c21 = 0 + 2- 8.02 < 0
C 22= u2+v2-c22 = 0 + 4-20.54 < 0
C 24= u2+v4-c24 = 0 + 5.78 – 6.74 < 0
C 32= u3+v2-c32 = 0.0+ 4- 27.86 < 0
C 33= u3+v3-c33 = 0.0+ 2 - 8.02 < 0

11 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

C 34= u3+v4-c34 = 0.0+ 5.87- 8.47 < 0

C 35= u3+v5-c35 = 0+10.67-15.2 < 0
C 41= u4+v1-c41 = -2.78 + 2.0 – 8.41 < 0
C 42= u4+v2-c42 =-2.78 + 4.0 – 21.52 < 0
C 43= u4+v3-c43 = -2.78 +2 – 6.74 < 0
C 46= u4+v6-c46 = -2.78 +0.0 – 0.0 > 0
Since all of them are negative the solution is optimal

Cost = 4x50,000 + 0x50,000 + 2x60,000 + 10.67*5,000 + 0x35,000 + 2x55,000

+ 0x45,000 +3x60,000 + 7.89x40,000 = $978,950
Present Value =
Production and Shipping Cost=8.33x978,950= $8,154,653.5
Operation costs of Plants = 8.33x4*50,000 = $1,666,000
Construction Cost: $3,000,000
Total Present =$12,820,653.5

Case4: Adding Uouston and Atlanta

Vogels’s method yields the following

NE NW MW SE SW Dummy Supply Penality
LA X -
50,000 50,000
Chicago X -
60,000 40,000
NY X -
55,000 45,000
Atlanta X -
60,000 40,000
Houston X -
45,000 55,000
Demand X X X X X X
Penality - - - - - -

The Initial bfs

X12 =50,000, X16 = 50,000, X23 =60,000, X26 = 40,000, X31+55,000, X36 =45,000,
X44 =60,000, X46 =40,000 , X55 =45,000, X56 =55,000 and X11= X13= X14= X15 = X21=
X22= X24= X25= X32= X33= X34= X35= X41= X42= X43= X45= X51= X52= X53= X54 = 0

Pricing out the non-basic variable

C 11=u1+v1-c11 = 0+ 2 -27.86 < 0
C 13= u1+v3-c13 = 0+ 2-20.54 < 0

12 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

C 14= u1+v4-c14 = 0+ 3-21.52 < 0

C 15= u1+v5-c15 = 0+3-13.87 < 0
C 21= u2+v1-c21 = 0 + 2- 8.02 < 0
C 22= u2+v2-c22 = 0 + 4-20.54 < 0
C 24= u2+v4-c24 = 0 + 3 – 6.74 < 0
C 25= u2+v4-c24 = 0 + 3 – 10.67 < 0
C 32= u3+v2-c32 = 0.0+ 4- 27.86 < 0
C 33= u3+v3-c33 = 0.0+ 2 - 8.02 < 0
C 34= u3+v4-c34 = 0.0+ 3- 8.47 < 0
C 35= u3+v5-c35 = 0+3-15.2 < 0
C 41= u4+v1-c41 = 0+ 2.0 – 8.41 < 0
C 42= u4+v2-c42 =0 + 4.0 – 21.52 < 0
C 43= u4+v3-c43 = 0 +2 – 6.74 < 0
C 45= u4+v5-c45 = 0 +3 – 7.89 > 0
C 51= u5+v1-c51 = 0+ 2.0 – 15.2 < 0
C 52= u5+v2-c52 =0 + 4.0 – 13.87 < 0
C 53= u5+v3-c53 = 0 +2 – 10.78 < 0
C 54= u5+v4-c54 = 0 +3 – 7.89 > 0

Since all of them are negative, the solution is optimal

Cost = 4x50,000 + 0x50,000 + 2x60,000 + 0*40,000 + 2x55,000 + 0x45,000 +

3x60,000 + 0x40,000 + 3x45,000 + 0x55,000 = $745,000
Present Value =
Production and Shipping Cost=8.33x745,000= $6,205,850.0
Operation costs of Plants = 8.33x5*50,000 = $2,082,500
Construction Cost: $6,000,000
Total Present =$14,288,350.0
Therefore, the minimum Present Value to Build the Plant At Atlanta Only.

X12 =50,000, X16 = 50,000, X23 =60,000, X25 = 5,000, X26 = 35,000, X31+55,000,
X36 =45,000, X44 =60,000, X45 =40,000
With the Total Present Value =$12,820,653.5

13 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Q4.

ACTIVIT DISCRIPTION PREDECESSO DURATIO

Y R N

A Design the product - 6

B Survey the Market - 5

C Place order for raw materials A 3

D Receive raw Materials C 2

E Build Prototype of product A, D 3

F Develop Ad Camaign B 2

G Setup plan for mass prodn E 4

H Deliver product to stores G, F 2

a. Draw Project Diagram

F H
6 7
B 4 2 8
1 5
G 4
A 6
3 2 3
2
4 5
E
C 3 D

b. Determine the Critical Path with the critical activity

The Critical Path is 1 – 2 – 3 – 4 – 5 – 7 – 8 with the critical Activity
A, C, D, E, G and H
c. The total and Free float
Activity Total Float Free Float
A 0 0
B 9 0
C 0 0
D 0 0

14 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

E 0 0
F 0 0
G 0 0
H 0 0

d. Linear Programming That Gives the critical Path

Let X1-X8 be Activities
Minimize Z= x8-x1
St.
x2-x1 ≥ 6
x6-x1 ≥ 5
x3-x2 ≥ 3
x4-x3 ≥ 2
x5-x4 ≥ 3
x7-x5 ≥ 4
x7-x6 ≥ 4
x8-x7 ≥ 2
All variable are Non Negative

Excel out puts from solver

Fig3 Setting of functions and constraints

15 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Fig3 Setting of functions and constraints

Fig3 Setting of functions and constraints

Fig3 Setting of functions and constraints

16 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Q5.

f ( x )=¿ 48x- 60x 2 +x 3

a. Use the 1st 2nd Derivative to find local Maxima and Local Minima of f(x).

f ' ( x )=¿ 48-120x+3x2

Solving this quadratic equation to zero

x= 39.6 or x=0.4

the local maximum and local minimum is found At x=0.4 and 39.6

Local Minimum =48(39.6)-60(39.6)2+939.6)3 = - 30.1

Local maximum =48(0.4)-60(0.4)2+(0.4)3= 9.664

b. Use 1st and 2nd derivative to show that f ( x ) has neither a global
maximum or a global minimum because it is un bounded in both direction
Taking the 1st derivative test and graph

Since the graph is un bounded in both direction the function doesn’t have
neither global maximum nor global minimum.

Q9 Objective: purchase computers

Criteria: cost

Support

Expandability

17 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Alternative: Computer 1

Computer 2

Computer 3

Objective
Purcahse computer
.

Criteria

Cost Cost Cost

Comp1 Comp2 Comp3

Pair wise comparison of objective

Criteria Cost Support Expandability

Cost 1 1/4 1/5
Support 4 1 1/2
Expandability 5 2 1
Sum 10 3.25 1.7
1. Divide each entry pi column p by the sum of the entries in the column
(i)

Criteria Cost Support Expandability

Cost 0.1 0.077 0.118
Support 0.4 0.308 0.294
Expandability 0.5 0.615 0.588
2. Find out Approximation to w max
0.1+0.077+0.118
w1= 3
= 0.098

0.4+0.308+ 0.294
w1= 3
= 0.334

18 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

0.5+0.615+0.588
w1= 3
= 0.568

3. Average weight

Criteria Cost Support Expandability Ave Weight

Cost 0.1 0.077 0.118 0.098
Support 0.4 0.308 0.294 0.334
Expandability 0.5 0.615 0.588 0.568
Check Consistency

Criteria 0.098 0.334 0.568

Weight
Cost Support Expandability
Cost 1*0.098 0.25*0.33 0.2*0.568
4
Support 4*0.098 1*0.334 0.5*0.568
Expandability 5*0.098 2*0.334 1*0.568

Criteria 0.098 0.334 0.568

Cost Suppo Expandabili Wt CritWeig Value
rt ty sum ht wt/criteri
value a
Cost 0.098 0.085 0.1136 0.295 0.098 3.011
1
Support 0.392 0.334 0.284 1.01 0.334 3.024
Expanda 0.49 0.668 0.568 1.726 0.568 3.039
bility

3.011+3.024+3.039
λmax = =3.0246
3

λ max−n
Consistency index(CI) = =00123, where n= no of criteria
n−1

CI= 0.0123

n 1 2 3 4 5 6 7 8 9
RI 0.00 0.00 0.58 0.80 1.12 1.24 1.32 1.41 1.45

19 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

CI 0.0123
Consistency Ratio = = =0.0212
RI 0.58

Therefore , this decision is consistent and acceptable.

Pair wise components of computers

1. Divide by total Sum (consistency criteria cost)

On cost Computer1 Computer2 Computer3

Computer 1 1 3 5
Computer2 1/3 1 2
Computer 3 1/5 1/2 1
Sum 1.533 4.5 8
2. Sum and Divide each value by the corresponding values sum in
column

On cost Computer1 Computer2 Computer3 Wt Ave.

Computer 1 0.652 0.66 0.625 0.647
Computer2 0.217 0.222 0.25 0.223
Computer 3 0.130 0.111 0.125 0.122

0.652+ 0.66+0.621
w1= 3
= 0.647

0.217+0.222+0.25
w1= 3
= 0.223

0.130+0.111+0.125
w1= 3
= 0.122

1. Divide by total sum ( corresponding Criteris)

On Support Computer1 Computer2 Computer3

Computer 1 1 1/3 1/2

20 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Computer2 3 1 5
Computer 3 2 1/2 1
Sum 6 1.533 6.5

Sum and Divide Each value by the corresponding value sum in each column

On support Computer1 Computer2 Computer3 Wt Ave.

Computer 1 0.166 0.217 0.077 0.153
Computer2 0.5 0.652 0.769 0.640
Computer 3 0.333 0.130 0.154 0.205

0.166+0.217+ 0.077
w1= 3
= 0.0.153

0.5+0.652+0.769
w1= 3
= 0.640

0.333+0.130+0.154
w1= 3
= 0.205

2. Divide by total sum ( corresponding Criteris)

On Expand Computer1 Computer2 Computer3

Computer 1 1 1/2 1/7
Computer2 2 1 1/5
Computer 3 7 5 1
Sum 10 6.5 1.343

Sum and Divide Each value by the corresponding value sum in each column

On Expand Computer1 Computer2 Computer3 Wt Ave.

Computer 1 0.1 0.076 0.306 0.094
Computer2 0.2 0.154 0.186 0.18

21 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

Computer 3 0.7 0.769 0.745 0.738

0.1+0.076+0.306
w1= 3
= 0.094

0.2+0.154+ 0.186
w1= 3
= 0.18

0.7+0.769+ 0.745
w1= 3
= 0.738

Summary

  Cost Support Expandability Criteria Wt

C1 0.647 0.153 0.054 0.098
C2 0.223 0.64 0.18 0.334
C3 0.122 0.205 0.738 0.568

At computer 1
=(0.647*0.098)+(0.153*0.098)+(0.054*0.098)=0.087

At Computer 2
= (0.113*0.334)+(0.640*0.334)+(0.180*0.334)= 0.348

At Computer 3
=(0.122*0.568)+(0.205*0.568)+(0.738*0.568)= 0.604

Based on AHP Analysis Computer 3 is selected because it has the

highest score from other computers

Q10.
Using x as independent variable and y as dependent variable find the least square
line for the following three Data

X Y
1 2
4 5

22 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

7 2

Least squire method:

X Y XY X2
1 2 2 1
4 3 20 16
∑❑ 7 2 14 49
12 9 36 66

Equation= y=mx +b ----- linear equation

Y= b0+mx+b----- Line of best fit equation.

Slope=m

Y intercept=b=b0

Y= mx+b

m=n
∑ xy−∑ x ∑ y
∑ x 2−¿ ¿
3∗36−12∗9
=0
3∗66−144

m = 0 the slope is zero

y intercept = b=
∑ y−m ∑ x
n

9−0∗12
=3
3

b = 3 ---- y intercept

y= 3y

23 | P a g e SEMISTER ASSIGNMENT
SYSTEM ANALYSIS AND MANAGEMENT TECHNICS-1 FINAL ASSIGNMENT

24 | P a g e SEMISTER ASSIGNMENT