Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose a minimization integer programming problem was solved as an LP relaxation, and the objective function value was 253.67. Two decision variables had values of

Suppose a minimization integer programming problem was solved as an LP relaxation, and the objective function value was 253.67. Two decision variables had values of X1 = 12.45 and X2 = 32.75. If there is a single optimal solution, which of the following must be true for the integer solution?

A. X1 <= 12 and X2 <= 32

B. X1 >= 13 and X2 >= 33

C. X1 = 12

D. X2 = 32

E. Either A or B

F. None of the above

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Supply Chain Management A Logistics Perspective

Authors: John coyle, John Langley, Robert Novack, Brain Gibson

9th edition

9780538479189, 9781285400945, 538479191, 538479183, 1285400941, 978-0538479196

More Books

Students also viewed these General Management questions