Explore BrainMass
Share

Explore BrainMass

    integer (linear) programming model problem

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Solve the following integer (linear) programming model problem graphically by manual hand-drawn construction of the graph.

    Minimize 6X + 11Y

    Subject to 9X + 3Y > 27

    7X + 6Y > 42

    4X + 8Y > 32

    X, Y > 0 and integer

    a. Graph the constraints for this problem. Indicate all feasible solutions.

    b. Find the optimal solution to the LP model without integer restrictions. Round up to find a feasible integer solution. Is this solution optimal?

    c. Find the optimal solution for the original model as given.

    © BrainMass Inc. brainmass.com October 10, 2019, 1:07 am ad1c9bdddf
    https://brainmass.com/math/linear-programming/integer-linear-programming-model-problem-321941

    Solution Preview

    Solve the following integer (linear) programming model problem graphically by manual hand-drawn construction of the graph.
    Minimize 6X + 11Y
    Subject to 9X + 3Y >= 27
    7X + 6Y >= 42
    4X + 8Y >= 32
    X, Y >= 0 and integer
    a. Graph the constraints for this ...

    Solution Summary

    An integer (linear) programming model problem is solved graphically by manual hand-drawn construction of the graph.

    $2.19