Lingo解决邮局所需员工问题.doc

某邮局每天需一定数量的全职员工:星期一,17; 星期二,13;星期三,15; 星期四,19; 星期五,14; 星期六,16; 星期日,11. 全职员工连续工作5天后休息2天. 问该邮局学要多少员工？LINGO Model如下：model:sets:worker/1.5/:;job/1.4/:;link(worker,job):t,x;endsetsdata:t=22 18 30 1818 100 27 2226 20 28 2816 22 100 1421 100 25 28;enddatamin=sum(link:t*x);for(worker(i):sum(job(j):x(i,j)=1);for(job(j):sum(worker(i):x(i,j)=1);for(link:bin(x);End运算结果：Global optimal solution found. Objective value: 75.00000 Objective bound: 75.00000 Infeasibilities: 0.000000 Extended solver steps: 0 Total solver iterations: 0 Model Class: PILP Total variables: 20 Nonlinear variables: 0 Integer variables: 20 Total constraints: 10 Nonlinear constraints: 0 Total nonzeros: 60 Nonlinear nonzeros: 0 Variable Value Reduced Cost T( 1, 1) 22.00000 0.000000 T( 1, 2) 18.00000 0.000000 T( 1, 3) 30.00000 0.000000 T( 1, 4) 18.00000 0.000000 T( 2, 1) 18.00000 0.000000 T( 2, 2) 100.0000 0.000000 T( 2, 3) 27.00000 0.000000 T( 2, 4) 22.00000 0.000000 T( 3, 1) 26.00000 0.000000 T( 3, 2) 20.00000 0.000000 T( 3, 3) 28.00000 0.000000 T( 3, 4) 28.00000 0.000000 T( 4, 1) 16.00000 0.000000 T( 4, 2) 22.00000 0.000000 T( 4, 3) 100.0000 0.000000 T( 4, 4) 14.00000 0.000000 T( 5, 1) 21.00000 0.000000 T( 5, 2) 100.0000 0.000000 T( 5, 3) 25.00000 0.000000 T( 5, 4) 28.00000 0.000000 X( 1, 1) 0.000000 22.00000 X( 1, 2) 1.000000 18.00000 X( 1, 3) 0.000000 30.00000 X( 1, 4) 0.000000 18.00000 X( 2, 1) 1.000000 18.00000 X( 2, 2) 0.000000 100.0000 X( 2, 3) 0.000000 27.00000 X( 2, 4) 0.000000 22.00000 X( 3, 1) 0.000000 26.00000 X( 3, 2) 0.000000 20.00000 X( 3, 3) 0.000000 28.00000 X( 3, 4) 0.000000 28.00000 X( 4, 1) 0.000000 16.00000 X( 4, 2) 0.000000 22.00000 X( 4, 3) 0.000000 100.0000 X( 4, 4) 1.000000 14.00000 X( 5, 1) 0.000000 21.00000 X( 5, 2) 0.000000 100.0000 X( 5, 3) 1.000000 25.00000 X( 5, 4) 0.000000 28.00000 Row Slack or Surplus Dual Price 1 75.00000 -1.000000 2 0.000000 0.000000 3 0.000000 0.000000 4 1.000000 0.000000 5 0.000000 0.000000 6 0.000000