[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fWriohpjvQyIJYXImwvoAPJ7sh8i6LPSr-YhpDS30iwQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-06-16 11:56:21",151942923,[8,9,10,11],"确定最优决策","描述阶段开始时的客观条件","记录决策结果","评价策略的效果",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},60,"57446f9c072bdbe178787533fe575025","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F121050c1678a64324be7a3f91e62cdb3.png","运筹学与最优化方法","exam_123460676","章节测验1","状态变量在动态规划中的作用是什么",[21,32,41,50,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],151942917,[25,26,27,28],"风险期望原则","最小最大遗憾原则","最大最小原则","最大最大原则","下列哪个决策原则被称为乐观主义原则( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],151942919,[36,37,38,39],"每隔一定时间补充一次","当库存量到达一定水平时补充","仅在特定日期补充","根据市场价格决定补充时间","存储策略中的循环策略指的是",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],151942921,[45,46,47,48],"只有原问题解是最优的","只有对偶问题解是最优的","原问题和对偶问题的解都是最优的","原问题和对偶问题都没有解","如果原问题和对偶问题中的目标函数值相等,这说明了什么",{"answer":51,"createTime":5,"id":6,"options":52,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],151942925,[57,58,59,60],"优先权服务","先到先服务","随机服务","后到先服务","在旅客运输服务系统中,车站设置军人候车室得旅客上车属于排队服务规则中的( )规则",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],151942927,[66,67,68,69],"客户和企业","客户和加工设备","客户和加工车间","订单和加工车间","在企业运作管理中,"按客户订单进行加工的加工车间"的排队系统中,顾客和服务员是( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],151942929,[75,76,77,78],"一个非常小的负数","一个非常大的正数","零","一个非常大的负数","在使用大M方法时,人工变量的系数在目标函数中应设置为多少",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],151942931,[84,85,86,87],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe7f80490e360912a8d031709f0baa2f8.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff3a9abda10eea064bbe2acfe22513eb9.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2c1ebddb960588c18b9565a50b574c0e.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe3d97483c1e6489d4794dfdf9a4169ed.png\">","下列运输问题的最优运输方案为:\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa4eab5d49a6985fa329c8fb825e5be64.png\">",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],151942934,[93,94,95,96],"不允许缺货","允许缺货","允许无限制生产","不允许任何生产","模型三允许",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],151942936,[102,103,104,105],"服务时间服从指数分布","到达时间服从指数分布","服务时间服从泊松分布","到达时间服从泊松分布","在M\u002FM\u002F1 排队系统中,第2个M代表"]