Scribd Logo
Upload

Welcome to Scribd!

  • Solve by Using "Simplex Method".: 2. Maximize Z 3x

    Uploaded by

    Nadim Rahman Khan
    8 views2 pages
    This document provides two linear programming problems to solve using the simplex method. The first problem seeks to maximize the objective function Z=3x1+2x2 given the constraints 2x1+x2≤6, x1+2x2≤6, x1≥0, and x2≥0. The second problem also aims to maximize an objective function, Z=3x1+2x2, but with the constraints x1≤4, x1+3x2≤15, 2x1+x2≤10, x1≥0, and x2≥0. It also provides a reminder that any assignment solving these problems is due on the last day

    Original Description:

    Original Title

    Assignment 2

    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 provides two linear programming problems to solve using the simplex method. The first problem seeks to maximize the objective function Z=3x1+2x2 given the constraints 2x1+x2≤6, x1+2x2≤6, x1≥0, and x2≥0. The second problem also aims to maximize an objective function, Z=3x1+2x2, but with the constraints x1≤4, x1+3x2≤15, 2x1+x2≤10, x1≥0, and x2≥0. It also provides a reminder that any assignment solving these problems is due on the last day

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views2 pages

    Solve by Using "Simplex Method".: 2. Maximize Z 3x

    Uploaded by

    Nadim Rahman Khan
    This document provides two linear programming problems to solve using the simplex method. The first problem seeks to maximize the objective function Z=3x1+2x2 given the constraints 2x1+x2≤6, x1+2x2≤6, x1≥0, and x2≥0. The second problem also aims to maximize an objective function, Z=3x1+2x2, but with the constraints x1≤4, x1+3x2≤15, 2x1+x2≤10, x1≥0, and x2≥0. It also provides a reminder that any assignment solving these problems is due on the last day

    Copyright:

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

    1. Solve by using “Simplex Method”.

    2. Maximize Z= 3x1 +2x2

    Subject to,

    2x1 + x2 ≤ 6

    x1+ 2x2 ≤6

    And

    x1 ≥ 0, x2 ≥ 0

    3.

    Maximize Z = 3x1+ 2x2

    Subject to,

    x1 ≤ 4

    x1 + 3x2 ≤ 15

    2x1+ x2 ≤ 10

    And

    x1 ≥ 0, x2 ≥ 0

    Attention: Assignment needs to be submitted on the day of Last class in the classroom.

    Write your name and ID on the front page. Do not cross the deadline and do not try to

    submit it after the deadline.

    You might also like