## Related questions with answers

Question

Use the branch-and-bound method to find the optimal solution to the following IP:

$\begin{aligned} \max z &=7 x_{1}+3 x_{2} \\ \text { s.t. } & 2 x_{1}+x_{2} \leq 9 \\ & 3 x_{1}+2 x_{2} \leq 13 \\ & x_{1}, x_{2} \geq 0 ; x_{1}, x_{2} \text { integer } \end{aligned}$

Solution

VerifiedStep 1

1 of 7In order to solve this IP using the branch-and-bound method, we must first solve its LP relaxation. If all solutions of the LP relaxation are integers, then this solution is also the solution of the given IP. Since the solution of the LP relaxation is at some vertex of its feasible region, by computing the value of $z$ for these points, we conclude that $(x_{1},x_{2})=(13/3,0)$ is its optimal solution since it maximizes the value of $z$.

## Create a free account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

## Create a free account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

## Recommended textbook solutions

#### Introduction to Operations Research

10th Edition•ISBN: 9780073523453Frederick S. HillierVerified solutions

#### Operations Research: Applications and Algorithms

4th Edition•ISBN: 9780534380588 (5 more)Wayne L Winston1,445 solutions

#### A Mathematical Look at Politics

1st Edition•ISBN: 9781439819838Daniel H. Ullman, E. Arthur Robinson Jr.## More related questions

- environmental science

1/4

- environmental science

1/7