(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.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
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
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.