If a Side Constraint for a Network Flow Model Cannot

Multiple Choice

If a side constraint for a network flow model cannot be avoided, and non-integer solutions result, how can the solution be expressed as an integer solution?

A) Apply integer programming techniques.
B) Round off all the non-integer arc flow decision variables.
C) Increase the supply until the solutions are all integer using a dummy supply node.
D) Increase the demand until the solutions are all integer using a dummy demand node.