To solve the shortest route problem, we can consider Dijkstra Algorithm and Bellman Algorithm. ( ） A:错 B:对 答案：关注公众号【题涯答案】免费查看 Any LP problem has its unique dual problem.（ ） A:错 B:对 答案：关注公众号【题涯答案】免费查看 There are three common techniques to solve integer programming, including branch-and-cut, branch-and-bound, and bionic algorithm.（ ） A:错 B:对 答案：关注公众号【题涯答案】免费查看 Graph theory is to study the objects and their relationships, and it’s independent of the geometric shape of the graph. ( ） A:对 B:错 答案：关注公众号【题涯答案】免费查看 CPM consists of activities with 0 time slack.（ ） A:对 B:错 答案：关注公众号【题涯答案】免费查看 Dijkstra Algorithm can solve the shortest route problem of directed graph with positive weight or negative weight. ( ) A:对 B:错 答案：关注公众号【题涯答案】免费查看 The decision variable values in Binary integer programming are either 0 or 1. ( ) A:对 B:错 答案：关注公众号【题涯答案】免费查看 If a linear programming problem has two different optimal solutions, then it has infinite optimal solutions. （ ） A:对 B:错 答案：关注公众号【题涯答案】免费查看 When we calculate test numbers by closed loop method, there must be an even number of cells with a closed loop in one row or column. ( ） A:错 B:对 答案：关注公众号【题涯答案】免费查看 Whereas a backward pass through the network is made to determine the earliest times, the latest times are computed using a forward pass. （ ） A:错 B:对 答案：关注公众号【题涯答案】免费查看 Under the expected value criterion, as long as the decision maker estimates the probability of occurrence of each state of nature, the expected value for each decision alternative can be computed. ( ) A:错 B:对 答案：关注公众号【题涯答案】免费查看 Both branch-and-cut technique and branch-and-bound technique are based on linear programming to solve integer programming. ( ) A:对 B:错 答案：关注公众号【题涯答案】免费查看 Sensitivity analysis only focus on the changes in objective function coefficients. ( ) A:对 B:错 答案：关注公众号【题涯答案】免费查看 During the process of calculating the lowest cost schedule, the shortest duration may afford a higher total cost in the project. ( ) A:对 B:错 答案：关注公众号【题涯答案】免费查看 The optimal solution of integer programming is to find the corresponding linear programming optimal solution and then round it up. ( ) A:错 B:对 答案：关注公众号【题涯答案】免费查看
