[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f8VUKCibuD9Ve0hFEKkKTGGujcuaK4jt9KrTgZXtM5uc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-06-17 00:49:43",202150275,[8,9,10,11],"原问题","原问题的松弛问题","新的线性规划问题","无法确定",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},23,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_44118459","","对于线性规划问题,其对偶问题的对偶是( )",[21,33,42,52,61,70,79,88,97,106],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-06-17 00:49:41",202150263,[26,27,28,29],"差","和","积","商","线性规划一般模型中,自由变量可以用两个非负变量的什么来代换.( )","v1",1,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],202150264,[37,38,39,40],"线性规划问题如有最优解,则最优解可以在可行域顶点上达到","线性规划问题可能没有可行解","在图解法中,线性规划问题的可行域都是"凸"区域","线性规划问题一般都有最优解","对于线性规划问题,下列说法不正确的是( )",{"answer":43,"createTime":44,"id":45,"options":46,"question":51,"source":31,"type":32},[],"2025-06-17 00:49:42",202150265,[47,48,49,50],"内点","外点","顶点","几何点","线性规划问题若有最优解,则一定可以在可行域的( )上达到",{"answer":53,"createTime":44,"id":54,"options":55,"question":60,"source":31,"type":32},[],202150267,[56,57,58,59],"有限个","两个","三个","无穷多个","若线性规划问题的最优解同时在可行域的两个顶点处达到,那么该线性规划问题最优解为( )",{"answer":62,"createTime":44,"id":63,"options":64,"question":69,"source":31,"type":32},[],202150268,[65,66,67,68],"有无穷多个最优解","无解","有有限个最优解","有唯一最优解","用图解法求解一个关于最小成本的线性规划问题时,若其成本线与可行解区域的某一边重合,则该线性规划问题( )",{"answer":71,"createTime":44,"id":72,"options":73,"question":78,"source":31,"type":32},[],202150269,[74,75,76,77],"基","可行解","初始基本可行解","最优解","表上作业法的基本思想和步骤与单纯形法类似,因而初始调运方案的给出就相当于找到一个( )",{"answer":80,"createTime":44,"id":81,"options":82,"question":87,"source":31,"type":32},[],202150270,[83,84,85,86],"树的点树等于边数加1","树的任意两点间只有一条链","任何不连通图都不是树","树是边数最少的图","以下叙述中不正确的是( )",{"answer":89,"createTime":44,"id":90,"options":91,"question":96,"source":31,"type":32},[],202150271,[92,93,94,95],"目标函数不同","约束条件数量不同","决策变量是否要求取整数值","求解算法相同","整数规划模型与线性规划模型的主要区别在于( ) A",{"answer":98,"createTime":44,"id":99,"options":100,"question":105,"source":31,"type":32},[],202150273,[101,102,103,104],"令该变量大于其取整后的整数,且大于原非整数解","令该变量小于其取整后的整数,且小于原非整数解","令该变量小于等于其向下取整后的整数,和大于等于其向上取整后的整数","令该变量等于其取整后的整数","若整数规划问题的松弛问题最优解中,某一变量取值为非整数,采用分支定界法分支时,以下分支方式正确的是( )",{"answer":107,"createTime":5,"id":6,"options":108,"question":19,"source":31,"type":32},[],[8,9,10,11]]