Scribd Logo
Upload

Welcome to Scribd!

  • Module/submodel: Linear Programming Problem Title: Assignment Problem 1 Objective: Maximize

    Uploaded by

    John
    2 views1 page
    This document contains the results of a linear programming problem to maximize production based on constraints. The objective was to maximize butter, sauce, and jelly production. The optimal solution was to produce 41.27 units of butter, 0 units of sauce, and 126.98 units of jelly. This satisfied all time, labor hours, and apples constraints while achieving the maximum objective value of 27523.81. The ranging section shows the optimal variable values and dual values, as well as lower and upper bounds.

    Original Description:

    This is nothing, just ignore this

    Original Title

    Sol Q1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains the results of a linear programming problem to maximize production based on constraints. The objective was to maximize butter, sauce, and jelly production. The optimal solution was to produce 41.27 units of butter, 0 units of sauce, and 126.98 units of jelly. This satisfied all time, labor hours, and apples constraints while achieving the maximum objective value of 27523.81. The ranging section shows the optimal variable values and dual values, as well as lower and upper bounds.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Module/submodel: Linear Programming Problem Title: Assignment Problem 1 Objective: Maximize

    Uploaded by

    John
    This document contains the results of a linear programming problem to maximize production based on constraints. The objective was to maximize butter, sauce, and jelly production. The optimal solution was to produce 41.27 units of butter, 0 units of sauce, and 126.98 units of jelly. This satisfied all time, labor hours, and apples constraints while achieving the maximum objective value of 27523.81. The ranging section shows the optimal variable values and dual values, as well as lower and upper bounds.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Muhammad Asim Rauf OR

    C:\Users\Muhammad Asim Rauf\Documents\QM for Windows\Assignment Q1.lin


    Module/submodel: Linear Programming
    Problem title: Assignment Problem 1
    Objective: Maximize

    Linear Programming Results


    Butter Sauce Jelly RHS Dual

    Maximize 190 170 155

    Time 3.5 5.2 2.8 <= 500 52.38

    Labor Hours 1.2 .8 1.5 <= 240 5.56

    Apples 40 55 20 <= 6500 0

    Solution 41.27 0 126.98 27523.81

    Ranging

    Variable Value Reduced Cost Original Val Lower Bound Upper Bound
    Butter 41.27 0 190 153.69 193.75
    Sauce 0 106.83 170 -Infinity 276.83
    Jelly 126.98 0 155 152 213.69
    Dual Value Slack/Surplus Original Val Lower Bound Upper Bound
    Time 52.38 0 500 448 621.25
    Labor Hours 5.56 0 240 171.43 267.86
    Apples 0 2309.52 6500 4190.48 Infinity

    15 October 2019 12:27 PM 1 of 1

    You might also like