THANK YOU!!

- If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint. True O False An optimum solution to an integer programming problem with only s constraints is always ensured by rounding down all non-integer decision variable values. True False The linear programming model for a transportation problem uses a set of supply constraints (for each potential source) and a set of demand constraints (for each potential destination). True False In a transportation problem, items are allocated from sources (supply points) to destinations (demand points) with an objective function that normally is to maximize revenue. O True False