Which of the following problems can be solved as a linear program using integer decision variables?
A)maximal-flow problem
B)shortest-route problem
C)minimal-spanning tree problem
D)Yehudi's dilemma

Question

Quizplus · Accepted Answer

The maximal-flow problem can be formulated as a linear program with integer decision variables. The decision variables represent the flow along each arc in the network, and integer constraints ensure that the flow is a whole number. The other problems listed cannot be formulated as linear programs with integer decision variables.

Which of the Following Problems Can Be Solved as a Linear