Scribd
Upload
15 views

Post Office Problem

This document contains information about a linear programming problem to minimize the number of workers required each day. It provides the decision variables, objective, constraints, and shows the left-hand side, right-hand side and slack or deviation for each constraint. The optimal solution is to use 3 workers on Monday, 4 workers on Tuesday, 1 worker on Wednesday, and 8 workers on Thursday, with 0 workers for the remaining days to minimize the sum of deviations from the constraints.

Uploaded by

Prince Jain
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
15 views

Post Office Problem

This document contains information about a linear programming problem to minimize the number of workers required each day. It provides the decision variables, objective, constraints, and shows the left-hand side, right-hand side and slack or deviation for each constraint. The optimal solution is to use 3 workers on Monday, 4 workers on Tuesday, 1 worker on Wednesday, and 8 workers on Thursday, with 0 workers for the remaining days to minimize the sum of deviations from the constraints.

Uploaded by

Prince Jain
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

x1 x2 x3 x4 x5 x6

Decision Variables 6 3 3 7 0 3

Objective 23 Minimize the no. of workers

Constraints
Monday 1 0 0 1 1 1
Tuesday 1 1 0 0 1 1
Wednesday 1 1 1 0 0 1
Thursday 1 1 1 1 0 0
Friday 1 1 1 1 1 0
Saturday 0 1 1 1 1 1
Sunday 0 0 1 1 1 1
x7
1

LHS RHS
1 17 >= 17
1 13 >= 13
1 16 >= 15
1 20 >= 19
0 19 >= 14
0 16 >= 16
1 14 >= 11
x1 x2 x3 x4 x5 x6
Decision Variables 4 5 0 7 0 4

Objective 3 Minimize the maximum slack on any given day

Constraints
Monday 1 0 0 1 1 1
Tuesday 1 1 0 0 1 1
Wednesday 1 1 1 0 0 1
Thursday 1 1 1 1 0 0
Friday 1 1 1 1 1 0
Saturday 0 1 1 1 1 1
Sunday 0 0 1 1 1 1
x7
3

LHS RHS Slack


1 18 >= 17 1
1 16 >= 13 3
1 16 >= 15 1
1 19 >= 19 0
0 16 >= 14 2
0 16 >= 16 0
1 14 >= 11 3
x1 x2 x3 x4 x5 x6
Decision Variables 3 4 1 8 0 3

Objective 7 Minimize the sum of deviation

Constraints
Monday 1 0 0 1 1 1
Tuesday 1 1 0 0 1 1
Wednesday 1 1 1 0 0 1
Thursday 1 1 1 1 0 0
Friday 1 1 1 1 1 0
Saturday 0 1 1 1 1 1
Sunday 0 0 1 1 1 1
x7
3

LHS RHS Deviation


1 17 17 0
1 13 13 0
1 14 15 1
1 19 19 0
0 16 14 2
0 16 16 0
1 15 11 4

You might also like