Stats Solutions

(All Steps) Consider the following integer programming problem: MaxZ=3X_1+2X_2 s.t. 3X_1+5X_2≤ 30 4X_1+2X_2≤ 28 X_1≤ 8 X_1,X_2≥ 0 The solution

Question: Consider the following integer programming problem:

\[MaxZ=3{{X}_{1}}+2{{X}_{2}}\]

s.t. \[3{{X}_{1}}+5{{X}_{2}}\le 30\]

\[4{{X}_{1}}+2{{X}_{2}}\le 28\] \[{{X}_{1}}\le 8\] \[{{X}_{1}},{{X}_{2}}\ge 0\]

The solution to the linear programming relaxation is X 1 = 5.714 and X 2 = 2.571.

  1. What is the upper bound for the value of the objective function?
  2. What is the value of the objective function for the rounded down solution?

c) Is the rounded down solution feasible? Justify your answer.

Price: $2.99
Solution: The downloadable solution consists of 2 pages
Deliverable: Word Document


∴ Other downloads you may be interested in ∴

log in to your account

Forgot password?
Don't have a membership account?
REGISTER

reset password

Back to
log in

sign up

Back to
log in