Business Homework Solutions
Problem
#71685

Quantitative Methods

Consider the following integer linear programming problem

Max Z =   3x1 + 2x2
Subject to: 3x1 + 5x2 30
                   4x1 + 2x2 28
         x1     8
       x1 ,x2 0 and integer
The solution to the Linear programming relaxation is: x1 = 5.714, x2= 2.571.
What is the upper bound for the value of the objective function?
What is the value of the objective function for the rounded down solution?
Is the rounded down solution feasible?


Solution Summary

Solution describes in detail about:
What is the upper bound for the value of the objective function?
What is the value of the objective function for the rounded down solution?
Is the rounded down solution feasible?

Solution
What is this?
By OTA - Overall OTA Rating
Sarang Jagdale, PhD (IP) - 5/5
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Quantitative Methods - True/False 1 Rounding non-integer solution values up to the nearest integer value will still result in a feasible solution to an integer programming problem. 2. Rounding non-integer solution val ...
  • Quantitative Methods - Consider the following integer linear programming problem Max Z = 3x1 + 2x2 Subject to: 3x1 + 5x2 30 4x1 + 2x2 28 x1 8 x1 ,x2 0 and integer The solut ...
  • Integer Programming Model - TRUE/FALSE 1. In a mixed integer model, some solution values for decision variables are integer and others can be non-integer. 2. In a total integer model, some solution values for decision va ...
  • Quantitative approaches : Management science - The transportation problem is a special case of the linear programming problem, but it often requires integer solutions. How can we be sure we get integer solutions?
  • Integer Linear Programming #3 - Enclosed problem in attachment. --- a. Graph the constraints for this problem. Use dots to indicate all feasible intergar solutions. b. Solve the LP Relaxation of this problem c. Find the opti ...
Browse