0

这是我下面的代码

     *********************************************/
dvar float+ x; /* daily quantity of t-shirts*/
dvar float+ y; /* daily quantity of shorts */


maximize 6*x + 10*y; /* maximize the daily profit from t-shirts and shorts*/

subject to{
20/60*x + 10/60*y <=176; /* cutting department labour constraint*/
20/60*x + 50/60*y <=400; /* sewing department labour constraint*/
10/60*x + 10/60*y <= 96; /* packaging department labour constraint*/
x >= 100; /* minimum daily demand for t-shirts*/
}

我想通过找到目标函数的协同效率来找到最佳解决方案不会改变的单位利润范围。谢谢。

4

1 回答 1

0

请参阅文档中的“敏感性分析”

IDE 和 OPL > 优化编程语言 (OPL) > 语言用户手册 > 应用领域 > 线性和整数规划的应用 > 线性规划

https://www.ibm.com/support/knowledgecenter/en/SS6MYV_3.4.0/ilog.odms.ide.odme.help/Content/Optimization/Documentation/ODME/_pubskel/ODME_pubskels/startall_ODME34_Eclipse1043.html

于 2018-01-13T06:57:48.827 回答