(Steps Shown) (a) Solve the following LP with the graphical method: maximize; z=2 x_1+3 x_2 , \text s.t. x_1+3 x_2 ≤q 9 , 3 x_1+x_2 ≤q 7 , x_1-x_2


Question: (a) Solve the following LP with the graphical method:

\[\begin{aligned} &\operatorname{maximize} \quad z=2 x_{1}+3 x_{2} \\ &\text { s.t. } & x_{1}+3 x_{2} \leq 9 \\ & & 3 x_{1}+x_{2} \leq 7 \\ & & x_{1}-x_{2} \leq 1 \\ & & x_{1}, \quad x_{2} \geq 0 \end{aligned}\]

(b) Use the branch-and-bound method to solve the problem above subject to the additional constraint that \(x_{1}\) and \(x_{2}\) must be integers.

Be sure to show the branch and bound tree.

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

log in to your account

Don't have a membership account?
REGISTER

reset password

Back to
log in

sign up

Back to
log in