运筹学实验报告一Word文档格式.docx

上传人:b****6 文档编号:19702051 上传时间:2023-01-08 格式:DOCX 页数:15 大小:35.25KB
下载 相关 举报
运筹学实验报告一Word文档格式.docx_第1页
第1页 / 共15页
运筹学实验报告一Word文档格式.docx_第2页
第2页 / 共15页
运筹学实验报告一Word文档格式.docx_第3页
第3页 / 共15页
运筹学实验报告一Word文档格式.docx_第4页
第4页 / 共15页
运筹学实验报告一Word文档格式.docx_第5页
第5页 / 共15页
点击查看更多>>
下载资源
资源描述

运筹学实验报告一Word文档格式.docx

《运筹学实验报告一Word文档格式.docx》由会员分享,可在线阅读,更多相关《运筹学实验报告一Word文档格式.docx(15页珍藏版)》请在冰豆网上搜索。

运筹学实验报告一Word文档格式.docx

(1)max=8*x1+6*x2;

9*x1+8*x2<

=12;

7*x1+11*x2<

=24;

9*x1+11*x2<

=13;

(2)Globaloptimalsolutionfound.

Objectivevalue:

10.66667

Totalsolveriterations:

0

VariableValueReducedCost

X11.3333330.000000

X20.0000001.111111

RowSlackorSurplusDualPrice

110.666671.000000

20.0000000.8888889

314.666670.000000

41.0000000.000000

(a)

2、运输问题:

已知6个发点8个收点的最小费用运输问题。

产销量及单位运价如下表。

销地

cij

产地

B1

B2

B3

B4

B5

B6

B7

B8

产量

A1

6

2

9

7

4

5

55

A2

3

8

47

A3

1

42

A4

52

A5

41

A6

32

销量

60

51

43

38

(2)计算结果(决策变量求解结果粘贴)

(1)model:

!

6发点8收点运输问题;

sets:

warehouses/wh1..wh6/:

capacity;

vendors/v1..v8/:

demand;

links(warehouses,vendors):

cost,volume;

endsets

目标函数;

min=@sum(links:

cost*volume);

需求约束;

@for(vendors(J):

@sum(warehouses(I):

volume(I,J))<

=demand(J));

产量约束;

@for(warehouses(I):

@sum(vendors(J):

volume(I,J))=capacity(I));

这里是数据;

data:

capacity=554742524132;

demand=6055514341524338;

cost=62974259

45538532

52137483

76799271

23657265

59228143;

enddata

end

473.0000

CAPACITY(WH1)55.000000.000000

CAPACITY(WH2)47.000000.000000

CAPACITY(WH3)42.000000.000000

CAPACITY(WH4)52.000000.000000

CAPACITY(WH5)41.000000.000000

CAPACITY(WH6)32.000000.000000

DEMAND(V1)60.000000.000000

DEMAND(V2)55.000000.000000

DEMAND(V3)51.000000.000000

DEMAND(V4)43.000000.000000

DEMAND(V5)41.000000.000000

DEMAND(V6)52.000000.000000

DEMAND(V7)43.000000.000000

DEMAND(V8)38.000000.000000

COST(WH1,V1)6.0000000.000000

COST(WH1,V2)2.0000000.000000

COST(WH1,V3)9.0000000.000000

COST(WH1,V4)7.0000000.000000

COST(WH1,V5)4.0000000.000000

COST(WH1,V6)2.0000000.000000

COST(WH1,V7)5.0000000.000000

COST(WH1,V8)9.0000000.000000

COST(WH2,V1)4.0000000.000000

COST(WH2,V2)5.0000000.000000

COST(WH2,V3)5.0000000.000000

COST(WH2,V4)3.0000000.000000

COST(WH2,V5)8.0000000.000000

COST(WH2,V6)5.0000000.000000

COST(WH2,V7)3.0000000.000000

COST(WH2,V8)2.0000000.000000

COST(WH3,V1)5.0000000.000000

COST(WH3,V2)2.0000000.000000

COST(WH3,V3)1.0000000.000000

COST(WH3,V4)3.0000000.000000

COST(WH3,V5)7.0000000.000000

COST(WH3,V6)4.0000000.000000

COST(WH3,V7)8.0000000.000000

COST(WH3,V8)3.0000000.000000

COST(WH4,V1)7.0000000.000000

COST(WH4,V2)6.0000000.000000

COST(WH4,V3)7.0000000.000000

COST(WH4,V4)9.0000000.000000

COST(WH4,V5)9.0000000.000000

COST(WH4,V6)2.0000000.000000

COST(WH4,V7)7.0000000.000000

COST(WH4,V8)1.0000000.000000

COST(WH5,V1)2.0000000.000000

COST(WH5,V2)3.0000000.000000

COST(WH5,V3)6.0000000.000000

COST(WH5,V4)5.0000000.000000

COST(WH5,V5)7.0000000.000000

COST(WH5,V6)2.0000000.000000

COST(WH5,V7)6.0000000.000000

COST(WH5,V8)5.0000000.000000

COST(WH6,V1)5.0000000.000000

COST(WH6,V2)9.0000000.000000

COST(WH6,V3)2.0000000.000000

COST(WH6,V4)2.0000000.000000

COST(WH6,V5)8.0000000.000000

COST(WH6,V6)1.0000000.000000

COST(WH6,V7)4.0000000.000000

COST(WH6,V8)3.0000000.000000

VOLUME(WH1,V1)0.0000004.000000

VOLUME(WH1,V2)55.000000.000000

VOLUME(WH1,V3)0.0000007.000000

VOLUME(WH1,V4)0.0000005.000000

VOLUME(WH1,V5)0.0000002.000000

VOLUME(WH1,V6)0.0000000.000000

VOLUME(WH1,V7)0.0000003.000000

VOLUME(WH1,V8)0.0000008.000000

VOLUME(WH2,V1)0.0000001.000000

VOLUME(WH2,V2)0.0000002.000000

VOLUME(WH2,V3)0.0000002.000000

VOLUME(WH2,V4)43.000000.000000

VOLUME(WH2,V5)0.0000005.000000

VOLUME(WH2,V6)0.0000002.000000

VOLUME(WH2,V7)4.0000000.000000

VOLUME(WH2,V8)0.0000000.000000

VOLUME(WH3,V1)0.0000004.000000

VOLUME(WH3,V2)0.0000001.000000

VOLUME(WH3,V3)42.000000.000000

VOLUME(WH3,V4)0.0000002.000000

VOLUME(WH3,V5)0.0000006.000000

VOLUME(WH3,V6)0.0000003.000000

VOLUME(WH3,V7)0.0000007.000000

VOLUME(WH3,V8)0.0000003.000000

VOLUME(WH4,V1)0.0000005.000000

VOLUME(WH4,V2)0.0000004.000000

VOLUME(WH4,V3)0.0000005.000000

VOLUME(WH4,V4)0.0000007.000000

VOLUME(WH4,V5)0.0000007.000000

VOLUME(WH4,V6)14.000000.000000

VOLUME(WH4,V7)0.0000005.000000

VOLUME(WH4,V8)38.000000.000000

VOLUME(WH5,V1)41.000000.000000

VOLUME(WH5,V2)0.0000001.000000

VOLUME(WH5,V3)0.0000004.000000

VOLUME(WH5,V4)0.0000003.000000

VOLUME(WH5,V5)0.0000005.000000

VOLUME(WH5,V6)0.0000000.000000

VOLUME(WH5,V7)0.0000004.000000

VOLUME(WH5,V8)0.0000004.000000

VOLUME(WH6,V1)0.0000004.000000

VOLUME(WH6,V2)0.0000008.000000

VOLUME(WH6,V3)0.0000001.000000

VOLUME(WH6,V4)0.0000001.000000

VOLUME(WH6,V5)0.0000007.000000

VOLUME(WH6,V6)32.000000.000000

VOLUME(WH6,V7)0.0000003.000000

VOLUME(WH6,V8)0.0000003.000000

1473.0000-1.000000

219.000000.000000

30.0000000.000000

49.0000000.000000

50.0000000.000000

641.000000.000000

76.0000000.000000

839.000000.000000

90.0000001.000000

100.000000-2.000000

110.000000-3.000000

120.000000-1.000000

130.000000-2.000000

140.000000-2.000000

150.000000-1.000000

3、一般整数规划问题:

某服务部门各时段(每2h为一时段)需要的服务员人数见下表。

按规定,服务员连续工作8h(即四个时段)为一班。

现要求安排服务员的工作时间,使服务部门服务员总数最少。

时段

服务员最少数目

10

11

13

N=8;

days/1..N/:

required,start;

!

每天所需的最少职员数;

required=10891113853;

最小化每周所需职员数;

min=@sum(days:

start);

@for(days(J):

@sum(days(I)|I#le#4:

start(@wrap(J+I+4,8)))>

=required(J));

23.00000

N8.0000000.000000

REQUIRED

(1)10.000000.000000

REQUIRED

(2)8.0000000.000000

REQUIRED(3)9.0000000.000000

REQUIRED(4)11.000000.000000

REQUIRED(5)13.000000.000000

REQUIRED(6)8.0000000.000000

REQUIRED(7)5.0000000.000000

REQUIRED(8)3.0000000.000000

START

(1)5.0000000.000000

START

(2)5.0000000.000000

START(3)8.0000000.000000

START(4)0.0000000.000000

START(5)0.0000000.000000

START(6)0.0000000.000000

START(7)5.0000000.000000

START(8)0.0000000.000000

123.00000-1.000000

20.000000-1.000000

37.0000000.000000

57.0000000.000000

60.000000-1.000000

70.0000000.000000

80.0000000.000000

92.0000000.000000

4、指派问题:

已知如下效率矩阵,求极大化指派问题。

15

12

17

14

7个工人,7个工作的分配问题;

workers/w1..w5/;

jobs/j1..j5/;

links(workers,jobs):

cost,volume;

max=@sum(links:

每个工人只能有一份工作;

@for(workers(I):

@sum(jobs(J):

volume(I,J))=1;

);

每份工作只能有一个工人;

@for(jobs(J):

@sum(workers(I):

cost=4871512

79171410

691287

6714610

6912106;

57.00000

COST(W1,J1)4.0000000.000000

COST(W1,J2)8.0000000.000000

COST(W1,J3)7.0000000.000000

COST(W1,J4)15.000000.000000

COST(W1,J5)12.000000.000000

COST(W2,J1)7.0000000.000000

COST(W2,J2)9.0000000.000000

COST(W2,J3)17.000000.000000

COST(W2,J4)14.000000.000000

COST(W2,J5)10.000000.000000

COST(W3,J1)6.0000000.000000

COST(W3,J2)9.0000000.000000

COST(W3,J3)12.000000.000000

COST(W3,J4)8.0000000.000000

COST(W3,J5)7.0000000.000000

COST(W4,J1)6.0000000.000000

COST(W4,J2)7.0000000.000000

COST(W4,J3)14.000000.000000

COST(W4,J4)6.0000000.000000

COST(W4,J5)10.000000.000000

COST(W5,J1)6.0000000.000000

COST(W5,J2)9.0000000.000000

COST(W5,J3)12.000000.000000

COST(W5,J4)10.000000.000000

COST(W5,J5)6.0000000.000000

VOLUME(W1,J1)0.0000007.000000

VOLUME(W1,J2)0.0000006.000000

VOLUME(W1,J3)0.00000010.00000

VOLUME(W1,J4)1.0000000.000000

VOLUME(W1,J5)0.0000001.000000

VOLUME(W2,J1)0.0000004.000000

VOLUME(W2,J2)0.0000005.000000

VOLUME(W2,J3)1.0000000.000000

VOLUME(W2,J4)0.0000001.000000

VOLUME(W2,J5)0.0000003.000000

VOLUME(W3,J1)1.0000000.000000

VOLUME(W3,J2)0.0000000.000000

VOLUME(W3,J3)0.0000000.000000

VOLUME(W3,J4)0.0000002.000000

VOLUME(W3,J5)0.0000001.000000

VOLUME(W4,

展开阅读全文
相关资源
猜你喜欢
相关搜索

当前位置:首页 > 解决方案 > 学习计划

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1