Back to quiz

6. In most question papers your asked to find the value of the cut. what can you deduce about this value?

  • The maximum flow is equal to this value
  • The minimum flow is less than or equal this value
  • The maximum flow is less than or equal tothis value
  • The minimum flow is equal to this value
  • The maximum flow is greater than this value

7. In dynamic programming you work backwards from the last stage to the first stage.

  • True
  • False

8. What is the beginning vertex and last vertex called in a network flow diagram

  • Source and Resource
  • Sink and Hole
  • Source and Sink
  • Tap and sink
  • Source and Tap

9. When you need to ad an extra row or column into a table for the hungarian algorithm to be performed you

  • Add a row/column in which every element is a zero
  • Add a row/column in which every element is the same as another row/column
  • Add a row/column in which every element is equal to the largest element in the table
  • Add a row/column in which every element is equal to the smallest element in the tab;e

10. Optimal value has been reached in a Linear programming tableau when

  • The top row elements are all zeros
  • The top row elements are all positive
  • The top row elements are all negatives
  • The top row only contains one negative
  • The top row elements all equal one