第四章Please solve the following integer problem and get the maximum Z= ( ).
答案:Z=4
A drilling team needs to determine 5 exploration wells from 10 alternative wells to minimize the total drilling cost. If 10 wells are represented by s1, s2, …s10, the costs being c1, c2, …c10, one of constraints is: if the plan chooses s3 or s4, then s5 cannot be selected and vice versa. We set a 0-1 variable, xj(j=1, 2, …10), then this constraint can be expressed ( )Branch-and-cut technique is only suitable for solving pure integer programming problems. ( ）Simply rounding off non-integer simplex solution values for models requiring integer solutions is not always appropriate. Rounding can often lead to suboptimal results. ( ）Assignment problem doesn’t belong to 0-1 integer programming problem. ( ）
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
