生产存储理论实验报告

1、生产存储理论实验报告 2015/11/14实 验一、 要求：1、 实验目的2、 实验内容3、 实验方法4、 结果分析二、 内容1 产品结构优化问题建模及求解已知某钢厂生产A、B两种产品，产品单价、成本及工时需求和原料需求见下表：AB上限工时需求2小时/吨1小时/吨40小时原料需求1吨/吨3吨/吨30吨单价14千元/吨10千元/吨成本5千元/吨3千元/吨问A、B各生产多少可获利最大？Program: Linear ProgrammingProblem Title : wo* Input Data *Max. Z = 9x1 + 7x2Subject toC1 2x1 + 1x2 <= 40

2、C2 1x1 + 3x2 <= 30* Program Output *Simplex Tableau : 0 Cj 9.000 7.000 0.000 0.000 Cb Basis Bi x 1 x 2 s 1 s 2- 0.000 s 1 40.000 2.000 1.000 1.000 0.000 0.000 s 2 30.000 1.000 3.000 0.000 1.000- Zj 0.000 0.000 0.000 0.000 0.000 Cj-Zj 9.000 7.000 0.000 0.000Simplex Tableau : 1 Cj 9.000 7.000 0.000

3、 0.000 Cb Basis Bi x 1 x 2 s 1 s 2- 9.000 x 1 20.000 1.000 0.500 0.500 0.000 0.000 s 2 10.000 0.000 2.500 -0.500 1.000- Zj 180.000 9.000 4.500 4.500 0.000 Cj-Zj 0.000 2.500 -4.500 0.000Simplex Tableau : 2 Cj 9.000 7.000 0.000 0.000 Cb Basis Bi x 1 x 2 s 1 s 2- 9.000 x 1 18.000 1.000 0.000 0.600 -0.2

4、00 7.000 x 2 4.000 0.000 1.000 -0.200 0.400- Zj 190.000 9.000 7.000 4.000 1.000 Cj-Zj 0.000 0.000 -4.000 -1.000Final Optimal SolutionZ = 190.000-Variable Value Reduced Cost- x 1 18.000 0.000 x 2 4.000 0.000-Constraint Slack/Surplus Shadow Price- C 1 0.000 4.000 C 2 0.000 1.000-Objective Coefficient

5、Ranges- Lower Current Upper Allowable AllowableVariables Limit Values Limit Increase Decrease- x 1 2.333 9.000 14.000 5.000 6.667 x 2 4.500 7.000 27.000 20.000 2.500 Right Hand Side Ranges - Lower Current Upper Allowable AllowableConstraints Limit Values Limit Increase Decrease- C 1 10.000 40.000 60

6、.000 20.000 30.000 C 2 20.000 30.000 120.000 90.000 10.000 * End of Output *2 存储理论1) EOQ模型：已知某厂某产品的年需求量为1000个，每年365天，提前期为3天，订货费用10/次，存储费0.5/年个。2) Economic lot size (经济生产批量模型)：已知某厂某产品的年需求量为10000个，需求率为60个每天，提前期为3天，订货费用100/次，存储费0.5/年个，生产速率为80个/天。3) Quantity discount model (有数量折扣的经济批量模型) 已知某厂某产品的年需求量为50

7、00个，每年365天，提前期为3天，订货费用49/次，存储费比率0.2。订货量<99999919992000价格54.804.754) ABC Analysis (ABC分析) 已知某厂产品信息为：123需求700020001000价格1010105) Planned Shortage (允许缺货的经济批量模型) 已知某厂某产品的年需求量为10000个，每年365天，提前期为3天，订货费用7.5/次，存储费2/年个，缺货损失10$/年。3 调度模型(作业中的N/1/#Tu问题)4 MRP计算系统N = Lead time = Lot size = Item1 2 NAGross dema

8、nd Planned in On hand Net demand Order Receipt Order Release ：录入 ：计算并显示/ ConsoleApplication1.cpp : 定义控制台应用程序的入口点。/#include "stdafx.h"#include <iostream>#include <vector>using namespace std;void main()int a, b, c, d;cout << "周期= "cin >> a;cout << &quo

9、t;初始库存= "cin >> b;cout << "批量= "cin >> c;cout << "提前期= "cin >> d;cout << endl;vector<int> maoXuqiu;/毛需求vector<int> jihuaRuku;/计划入库vector<int> yujiKucun;/预计库存vector<int> jingXuqiu;/净需求vector<int> jihuaDingdanru

10、ku;/计划订单入库vector<int> jihuaDingdanxiada;/计划订单下达int e;cout << "请输入毛需求" << endl;for (int i = 0; i != a; i+)cin >> e;maoXuqiu.push_back(e);cout << "请输入计划入库" << endl;for (int i = 0; i != a; i+)cin >> e;jihuaRuku.push_back(e);/计算预计库存for (declt

11、ype(maoXuqiu.size() i = 0; i != a; i+) if (i = 0) yujiKucun.push_back(b + jihuaRukui - maoXuqiui);if (i > 0)yujiKucun.push_back(yujiKucuni - 1 + jihuaRukui - maoXuqiui);/计算净需求for (decltype(maoXuqiu.size() i = 0; i != a; i+)if (i = 0)if (yujiKucuni > 0)jingXuqiu.push_back(0);else jingXuqiu.push

12、_back(maoXuqiui);if (i > 0)if (yujiKucuni > 0)jingXuqiu.push_back(0);else if (yujiKucuni < 0 && yujiKucuni - 1 > 0)jingXuqiu.push_back(-yujiKucuni);else if (yujiKucuni < 0 && yujiKucuni - 1 < 0)jingXuqiu.push_back(maoXuqiui);/计算计划订单入库int supply = 0, presupply = 0;fo

13、r (decltype(maoXuqiu.size() i = 0; i != a; i+)while (supply < jingXuqiui)supply += c;jihuaDingdanruku.push_back(supply - presupply);supply = supply - jingXuqiui;presupply = supply;/计算计划订单下达for (int i = 0; i != a; i+)if (i < a - d)jihuaDingdanxiada.push_back(jihuaDingdanrukui + d);else jihuaDin

14、gdanxiada.push_back(0);cout << "周期 "for (int i = 0; i != a; i+)cout << i + 1 <<" "cout << endl;cout << "毛需求 "for (int i = 0; i != a; i+)cout << maoXuqiui << " "cout << endl;cout << "计划入库 "for (int

15、 i = 0; i != a; i+)cout << jihuaRukui << " "cout << endl;cout << "预计库存 "for (int i = 0; i != a; i+)cout << yujiKucuni << " "cout << endl;cout << "净需求 "for (int i = 0; i != a; i+)cout << jingXuqiui <<

16、" "cout << endl;cout << "计划订单入库 "for (int i = 0; i != a; i+)cout << jihuaDingdanrukui << " "cout << endl;cout << "计划订单下达 "for (int i = 0; i != a; i+)cout << jihuaDingdanxiadai << " "cout << endl;sys