Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • IM423 or Sheet2 GraphicalSolution

    Загружено:

    Khaled Raouf
    78 просмотров2 страницы
    This document provides 10 linear programming problems to solve using the graphical method. Each problem defines an objective function to maximize or minimize and includes constraints on two variables x1 and x2. The problems involve determining the optimal values of x1 and x2 that satisfy the objective function and constraints.

    Исходное описание:

    bbn

    Авторское право

    © © All Rights Reserved

    Доступные форматы

    PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    This document provides 10 linear programming problems to solve using the graphical method. Each problem defines an objective function to maximize or minimize and includes constraints on two variables x1 and x2. The problems involve determining the optimal values of x1 and x2 that satisfy the objective function and constraints.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    78 просмотров2 страницы

    IM423 or Sheet2 GraphicalSolution

    Загружено:

    Khaled Raouf
    This document provides 10 linear programming problems to solve using the graphical method. Each problem defines an objective function to maximize or minimize and includes constraints on two variables x1 and x2. The problems involve determining the optimal values of x1 and x2 that satisfy the objective function and constraints.

    Авторское право:

    © All Rights Reserved
    Скачайте в формате PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 2

    2

    S H E E T

    Graphical Solution
    Arab Academy for Science and Technology
    College of Engineering and Technology
    Industrial and Management Engineering Department
    IM423 OPERATIONS RESEARCH
    Use the graphical method to solve the following LP models.
    1. Maximize Z = 3x1 + 5x2
    Subject to
    4

    x1
    2x2

    12

    3x1 + 2x2

    18

    x1 0, x2

    2. Maximize Z = 3x1 + 5x2


    Subject to
    4

    x1
    2x2

    12

    3x1 + 2x2

    18

    3x1 + 5x2

    50

    x1 0, x2

    3. Maximize Z = 3x1 + 2x2


    Subject to
    4

    x1
    2x2

    12

    3x1 + 2x2

    18

    x1 0, x2

    4. Maximize Z = 3x1 + 5x2


    Subject to
    x1

    x1 0, x2

    IM423 Operations Research

    Page 1 of 2

    5. Minimize Z = 15x1 + 20x2


    Subject to
    x1 + 2x2

    10

    2 x1 3x2

    x2

    x1 0, x2

    x1 +

    6. Minimize Z = 3x1 + 2x2


    Subject to
    x1 + 2x2

    12

    2 x1 + 3x2

    = 12

    2 x1 +

    x2

    x1 0, x2

    7. Minimize Z = 40x1 + 50x2


    Subject to
    2 x1 + 3x2

    30

    x1 +

    x2

    12

    2 x1 +

    x2

    20

    x1 0, x2

    8. Maximize Z = 800x1 + 900x2


    Subject to
    2 x1 + 4x2

    30

    4 x1 + 2 x2

    30

    x2

    x1 0, x2

    x1 +

    9. Maximize Z = 3x1 + 2x2


    Subject to
    2 x1 + 4x2

    22

    x1 + 4 x2

    10

    4 x1 2x2

    14

    x1 3x2

    x1 0, x2

    10. Minimize Z = 5x1 + x2


    Subject to
    3 x1 + 4x2

    = 24

    x1

    x1 + 3x2

    12

    x1 0, x2

    IM423 Operations Research

    Page 2 of 2

    Вам также может понравиться