Scribd Logo
Upload

Welcome to Scribd!

  • Document 1111

    Uploaded by

    abdelghani benali
    11 views1 page
    This document summarizes the results of a linear programming problem with two variables (X1 and X2) and three constraints. The objective is to maximize X1 * 5 + X2 * 3. The optimal solution is for X1 to be 43, X2 to be 31, which gives an optimal value of 308. This satisfies all constraints and provides the maximum value for the objective function.

    Original Description:

    حل ببرنامج سمبلكس

    Original Title

    document1111

    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 summarizes the results of a linear programming problem with two variables (X1 and X2) and three constraints. The objective is to maximize X1 * 5 + X2 * 3. The optimal solution is for X1 to be 43, X2 to be 31, which gives an optimal value of 308. This satisfies all constraints and provides the maximum value for the objective function.

    Copyright:

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

    Document 1111

    Uploaded by

    abdelghani benali
    This document summarizes the results of a linear programming problem with two variables (X1 and X2) and three constraints. The objective is to maximize X1 * 5 + X2 * 3. The optimal solution is for X1 to be 43, X2 to be 31, which gives an optimal value of 308. This satisfies all constraints and provides the maximum value for the objective function.

    Copyright:

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

    BENALI

    Module/submodel: Linear Programming


    Problem title: (untitled)
    Objective: Maximize

    Linear Programming Results


    X1 X2 RHS Dual

    Maximize 5 3

    Constraint 1 6 2 <= 320 ,7

    Constraint 2 4 8 <= 420 ,2

    Constraint 3 2 1 >= 96 0

    Solution-> 43 31 308

    Solution list
    Variable Status Value

    X1 Basic 43

    X2 Basic 31

    slack 1 NONBasic 0

    slack 2 NONBasic 0

    surplus 3 Basic 21

    Optimal Value (Z) 308

    vendredi 7 octobre 2022 19:47 1 of 1

    You might also like