Which of the following problems can be solved as a linear program using binary decision variables?
A)maximal-flow problem
B)shortest-route problem
C)minimal-spanning tree problem
D)minimum cut problem

Question

Quizplus · Accepted Answer

The shortest-route problem can be formulated as a linear program using binary decision variables to represent the inclusion or exclusion of edges in the path.

Which of the Following Problems Can Be Solved as a Linear