(17) The solution to the LP Relaxation of a maximization integer linear program provides a(n) a. upper bound for the value of the objective function. b. lower bound for the value of the objective function. c. upper bound for the value of the decision variables. d. lower bound for the value of the decision variables.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter8: Evolutionary Solver: An Alternative Optimization Procedure
Section8.3: Introduction To Evolutionary Solver
Problem 2P
icon
Related questions
Question

Please do not give solution in image format thanku

 

(17) The solution to the LP Relaxation of a maximization integer linear program provides
a(n)
a. upper bound for the value of the objective function.
b. lower bound for the value of the objective function.
c. upper bound for the value of the decision variables.
d. lower bound for the value of the decision variables.
(18) Let x1, x2, and x3 be 0-1 binary variables whose values indicate whether the
projects are not done (0) or are done (1). Which of the following answers indicates that
at least two of the projects must be done?
a. X1
X2 = 0
b. x1 + x2 + x3 ≤ 2
C. X1 + X2 + x3 = 2
d. x1 + x2 + x3 ≥ 2
(19) Assuming W₁, W2, and W3 are 0-1 integer variables, the constraint W₁ + W₂ + W3 ≤
1 is often called a
a. multiple-choice constraint.
b. mutually exclusive constraint.
c. k out of n alternatives constraint.
d. corequisite constraint.
Transcribed Image Text:(17) The solution to the LP Relaxation of a maximization integer linear program provides a(n) a. upper bound for the value of the objective function. b. lower bound for the value of the objective function. c. upper bound for the value of the decision variables. d. lower bound for the value of the decision variables. (18) Let x1, x2, and x3 be 0-1 binary variables whose values indicate whether the projects are not done (0) or are done (1). Which of the following answers indicates that at least two of the projects must be done? a. X1 X2 = 0 b. x1 + x2 + x3 ≤ 2 C. X1 + X2 + x3 = 2 d. x1 + x2 + x3 ≥ 2 (19) Assuming W₁, W2, and W3 are 0-1 integer variables, the constraint W₁ + W₂ + W3 ≤ 1 is often called a a. multiple-choice constraint. b. mutually exclusive constraint. c. k out of n alternatives constraint. d. corequisite constraint.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,