Explore BrainMass

Linear Programming : Objective Function & Feasible Solution

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

The solution shows how to calculate the upper bound of the objective function and the value of the objective function.