Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

Solution CPM Problem Linear Programing

project management

Uploaded by

4047-Prathiksha A
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
4 views

Solution CPM Problem Linear Programing

project management

Uploaded by

4047-Prathiksha A
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Activity

Earliest Start End Actual Network


Node Event Time Node (i) Node (j) Activity Time Activity Time
1 0 A 1 2 15 15
2 15 B 1 3 20 20
3 20 C 2 5 40 25
4 35 D 2 4 20 10
5 55 E 3 4 15 15
6 50 F 3 6 30 20
7 70 G 4 5 20 20
245 H 4 7 35 30
I 4 6 15 15
J 5 7 15 10
K 6 7 20 20
Microsoft Excel 16.0 Answer Report
Worksheet: [Solution CPM problem linear programing.xlsx]Sheet1
Report Created: 06-12-2024 14:55:29
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 9 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Solve Without Integer Constraints, Assume

Objective Cell (Min)


Cell Name Original Value Final Value
$B$13 Earliest Event Time 144 144

Variable Cells
Cell Name Original Value Final Value Integer
$B$6 Earliest Event Time 0 0 Integer
$B$7 Earliest Event Time 12 12 Integer
$B$8 Earliest Event Time 20 20 Integer
$B$9 Earliest Event Time 20 20 Integer
$B$10 Earliest Event Time 24 24 Integer
$B$11 Earliest Event Time 32 32 Integer
$B$12 Earliest Event Time 36 36 Integer

Constraints
Cell Name Cell Value Formula Status Slack
$F$6 Actual Activity Time 12 $F$6>=$G$6 Binding 0
$F$7 Actual Activity Time 8 $F$7>=$G$7 Binding 0
$F$8 Actual Activity Time 8 $F$8>=$G$8 Not Binding 4
$F$9 Actual Activity Time 0 $F$9>=$G$9 Binding 0
$F$10 Actual Activity Time 4 $F$10>=$G$10 Binding 0
$F$11 Actual Activity Time 12 $F$11>=$G$11 Binding 0
$F$12 Actual Activity Time 8 $F$12>=$G$12 Not Binding 4
$F$13 Actual Activity Time 4 $F$13>=$G$13 Binding 0
$F$9 Actual Activity Time 0 $F$9=0 Binding 0
$B$6:$B$12=Integer
t Integer Constraints, Assume NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [Solution CPM problem linear programing.xlsx]Sheet1
Report Created: 06-12-2024 14:55:29

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$6 Earliest Event Time 0 7 1 1E+030 7
$B$7 Earliest Event Time 12 0 1 1E+030 6
$B$8 Earliest Event Time 20 0 1 1E+030 5
$B$9 Earliest Event Time 20 0 1 1E+030 5
$B$10 Earliest Event Time 24 0 1 1E+030 1
$B$11 Earliest Event Time 32 0 1 1E+030 2
$B$12 Earliest Event Time 36 0 1 1E+030 1

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$F$6 Actual Activity Time 12 6 12 1E+030 12
$F$7 Actual Activity Time 8 5 8 1E+030 4
$F$8 Actual Activity Time 8 0 4 4 1E+030
$F$9 Actual Activity Time 0 0 0 0 1E+030
$F$10 Actual Activity Time 4 1 4 4 24
$F$11 Actual Activity Time 12 2 12 1E+030 4
$F$12 Actual Activity Time 8 0 4 4 1E+030
$F$13 Actual Activity Time 4 1 4 1E+030 36
$F$9 Actual Activity Time 0 4 0 1E+030 0
House Building Project
Activity
Earliest Actual Network
Event Activity Activity
Node Time Node (i) Node (j) Time Time
1 0 1 2 12 12 critical activities - in blue
2 12 2 3 8 8
3 20 2 4 8 4
4 20 3 4 0 0
5 24 4 5 4 4
6 32 4 6 12 12
7 36 5 6 8 4
144 6 7 4 4
critical activities - in blue

You might also like