川大《管理运筹学2449》13春在线作业1(Sichuan major management operations research 2449 13 spring online job 1).doc

川大《管理运筹学2449》13春在线作业1(Sichuan major management operations research 2449 13 spring online job 1).doc

  1. 1、本文档共17页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
川大《管理运筹学2449》13春在线作业1(Sichuan major management operations research 2449 13 spring online job 1)

川大《管理运筹学2449》13春在线作业1(Sichuan major management operations research 2449 13 spring online job 1) Sichuan major management operations research 2449 13 spring online job 1 14 spring 13 autumn have the total score: 100 test time: -- Single topic selection Multiple choice True or false (18 questions, 54 points.) 1. The original problem is the same as the optimal () of the dual problem. A. solution The target value of B. C. the solution structure D. The number of components of the solution Full mark: 3 2. The ith constraint equation of the original problem is the = type, and the variable of the dual problem is A. Redundant variable B. Free variables C. Relaxation variables D. Non-negative variables Full mark: 3 3. If the original problem is a standard type, the optimal solution value of the dual problem is equal to the relaxation variable in the optimal table of the original problem. A. value The number of B. C. Opportunity cost D. check number Full mark: 3 4. If the original problem is to minimize the target, then the optimal solution value of the dual problem is equal to the remaining variable in the optimal table of the original problem. A. opportunity cost The number of B. Value of C. D. The inverse of the opportunity cost Full mark: 3 In the standard model of linear programming (I = 1, 2,... n), it must be A. A positive number B. the negative C. unconstrained D. a non-zero Full mark: 3 If there is no flow f in G, f is G. A. the minimum flow B. maximum flow C. Minimum cost flow D. cannot be determined Full score: 3 7. If a linear programming problem has the optimal solution, it can be reached on the feasible region (). A. interior point B. the point C. pole D. the geometric point Full mark: 3 8. If the transport problem has been solved, the test number must be all A. Greater than or equal to zero B. greater than zero C. less than zero D. Less than or equal to zero Full mark: 3 9. If f is a stream of G, K is a secant of G, and Valf = CapK, then K must be (). A. minimum

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档