Integer Linear Programming

Question 1

(T/F) In general, rounding large values of decision variables to the nearest integer value causes fewer problems than rounding small values

Answer 1

True

Question 2

(T/F) If x1+x2 <= 500y1 and y1 is a binary variable, then if y1=0, x1 and x2 will be 0

Answer 2

True

Question 3

(T/F) Dual prices cannot be used for integer programming sensitivity analysis because they are designed for linear programs

Answer 3

True

Question 4

(T/F) Integer linear programs are harder to solve than linear programs

Answer 4

True

Question 5

Rounding the solution of an LP Relaxation to the nearest integer values provides…
A) a feasible but not necessarily optimal solution
B) an integer solution that is optimal
C) an integer solution that might be neither feasible nor optimal
d) an infeasible solution

Answer 5

C

Question 6

Let x1 and x2 be binary variables whose values indicate whether projects 1 and 2 are done or not done. Which answer indicates that project 2 can only be done if project 1 is done?
A) x1 + x2 = 1
B) x1 + x2 =2
C) x1 - x2 <= 0
D) x1 - x2 >= 0

Answer 6

D

Question 7

In an all integer linear program…
A) all objective function coefficients must be integer
B) all right-hand side values must be integer
C) all decision variables must be integer
D) all objective function coefficients and right-hand side values must be integer

Answer 7

C

Question 8

(T/F) A nonlinear optimization problem is any optimization problem in which at least one term in the objective function or a constraint is nonlinear

Answer 8

True

Question 9

(T/F) In the case of functions with multiple local optima, most nonlinear optimization software methods can get stuck and terminate at a local optimum

Answer 9

True

Question 10

The measure of risk most often associated with the Markowitz portfolio model is the ...
A) portfolio avg return
B) portfolio min return
C) portfolio variance
D) portfolio median

Answer 10

C