Scribd
Upload
1K views

Operations Research - Linear Programming Problem of Union Airways

Solved linear programming problem on personnel scheduling of Union Airways. Cost minimization is the objective of the problem and the solution is found using solver function of Microsoft Excel.

Uploaded by

Viral Bhogaita
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
1K views

Operations Research - Linear Programming Problem of Union Airways

Solved linear programming problem on personnel scheduling of Union Airways. Cost minimization is the objective of the problem and the solution is found using solver function of Microsoft Excel.

Uploaded by

Viral Bhogaita
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Formulation

of the Linear Programming Problem


1 170 1 1 1 1 Shifts & Costs 2 3 4 160 175 180 1 1 1 1 5 195 No. of Agents in the time period

Time Periods 6 AM TO 8 AM 8 A M T O 10 A M 10 AM TO 12 PM 12 PM TO 2 PM 2 PM TP 4 PM 4 PM TO 6 PM 6 PM TO 8 PM 8 PM TO 10 PM 10 PM T0 12 AM 12 A M T O 6 A M

Shifts Present Shift 1 Shift 1 & 2 Shift 1 & 2 Shift 1, 2 & 3 Shift 2 & 3 Shift 3 & 4 Shift 3 & 4 Shift 4 Shift 4 & 5 Shift 5 Number of agents Total Cost

1 1 1 1

1 1 1 1 43 7740

48 8160

31 4960

39 6825

1 1 15 Total 2925

48 79 79 118 70 82 82 43 58 15

Constraints >= 48 >= 79 >= 65 >= 87 >= 64 >= 73 >= 82 >= 43 >= 52 >= 15

30610

Answer Report
Objective Cell (Min) Cell $H$15 Total Cost Name Original Value 0 Final Value 30610

Variable Cells Cell $C$14 $D$14 $ E$ 1 4 $ F$ 1 4 $G$14

Name Number of agents Shifts Number of agents Number of agents Number of agents Number of agents

Original Value 0 0 0 0 0

Final Value 48 31 39 43 15

Integer Contin Contin Contin Contin Contin

Constraints Cell $H$4 $H$5 $H$6 $H$7 $H$8 $H$9 $H$10 $H$11 $H$12 $H$13

Name 6 AM T O 8 AM 1 +2 1 +2 1 +2 +3 2 +3 3 +4 3 +4 8 PM TO 10 PM 4 +5 12 AM TO 6 AM

Cell Value 48 79 79 118 70 82 82 43 58 15

Formula $H$4>=$J$4 $H$5>=$J$5 $H$6>=$J$6 $H$7>=$J$7 $H$8>=$J$8 $H$9>=$J$9 $H$10>=$J$10 $H$11>=$J$11 $H$12>=$J$12 $H$13>=$J$13

Status Binding Binding Not Binding Not Binding Not Binding Not Binding Binding Binding Not Binding Binding

Slack 0 0 14 31 6 9 0 0 6 0

Sensitivity Report
Variable Cells Cell $C$14 $D$14 $ E$ 1 4 $ F$ 1 4 $G$14 Constraints Cell $H$4 $H$5 $H$6 $H$7 $H$8 $H$9 $H$10 $H$11 $H$12 $H$13 Name 6 AM T O 8 AM 1 +2 1 +2 1 +2 +3 2 +3 3 +4 3 +4 8 PM TO 10 PM 4 +5 12 AM TO 6 AM Final Value 48 79 79 118 70 82 82 43 58 15 Shadow Price 10 160 0 0 0 0 175 5 0 195 Constraint R.H. Side 48 79 65 87 64 73 82 43 52 15 Allowable Increase 6 1 E+3 0 14 31 6 9 1 E+3 0 6 6 1 E+3 0 Allowable Decrease 48 6 1 E+3 0 1 E+3 0 1 E+3 0 1 E+3 0 6 6 1 E+3 0 6 Name Number of agents Shifts Number of agents Number of agents Number of agents Number of agents Final Value 48 31 39 43 15 Reduced Co st 0 0 0 0 0 Objective Coefficient 170 160 175 180 195 Allowable Increase 1 E+3 0 10 5 1 E+3 0 1 E+3 0 Allowable Decrease 10 160 175 5 195

Limits Report
Cell $H$15 Objective Name Total Cost Value 30610

Cell $C$14 $D$14 $ E$ 1 4 $ F$ 1 4 $G$14

Variable Name Number of agents Shifts Number of agents Number of agents Number of agents Number of agents

Value 48 31 39 43 15

Lower Limit 48 31 39 43 15

Objective Result 30610 30610 30610 30610 30610

Upper Limit #N/A #N/A #N/A #N/A #N/A

Objective Result #N/A #N/A #N/A #N/A #N/A

You might also like