Explore BrainMass

# True/False questions on integer programming

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

True/False

1. Rounding non-integer solution values up to the nearest integer value will still result in a feasible solution to an integer programming problem.

2. Rounding non-integer solution values up to the nearest integer value will still result in a feasible solution.

3. The solution to the LP relaxation of a minimization integer linear program provides an upper bound for the value of the objective function.

4. If we are solving a 0-1 integer programming problem, the constraint x1 = x2 s a conditional constraint.

#### Solution Preview

True/False

1 Rounding non-integer solution values up to the nearest integer value will still result in a feasible solution to an integer programming problem.

FALSE

The rounded solution may be unfeasible. If we round up non-integer solution values up to the nearest integer value the point may lie outside the feasible region, making this solution unfeasible.

2. ...

#### Solution Summary

Explanations and answers to four true/false questions on integer programming.

\$2.49