Scribd Logo
Upload

Welcome to Scribd!

  • CH#2

    Uploaded by

    HaseebAshfaq
    1 views12 pages
    This document contains 10 linear programming problems with decision variables X1 and X2. Each problem defines an objective function to maximize or minimize and includes constraints on X1 and X2. The problems cover topics like profit maximization, cost minimization, and determining quantities based on various limitations.

    Original Description:

    SMDA Chapter 2 solution excel file

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains 10 linear programming problems with decision variables X1 and X2. Each problem defines an objective function to maximize or minimize and includes constraints on X1 and X2. The problems cover topics like profit maximization, cost minimization, and determining quantities based on various limitations.

    Copyright:

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

    CH#2

    Uploaded by

    HaseebAshfaq
    This document contains 10 linear programming problems with decision variables X1 and X2. Each problem defines an objective function to maximize or minimize and includes constraints on X1 and X2. The problems cover topics like profit maximization, cost minimization, and determining quantities based on various limitations.

    Copyright:

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

    Dec Var

    X1

    X2
    10

    OBJ FUN.

    25

    Profit Max.
    775000

    Subject to:
    100000 <=
    50000 <=
    50000 <=

    100000
    70000
    50000

    X1
    X2

    No. of TGV spots


    No. of Magazine ads

    Dec Var.

    X1

    X2
    28

    OBJ FUN.

    X1
    X2

    3480

    Sunject to
    8 >=
    7.6 >=
    5 >=

    8
    6
    5

    No. of tons of TYPE1


    No. of tons of TYPE2

    o. of tons of TYPE1
    o. of tons of TYPE2

    Dec Var.

    X1

    X2
    130

    OBJ FUN.

    Profit max
    32500

    Subject to:
    260 <=
    130 <=

    260
    140

    X1
    X2

    No. of generators
    No. of alternators

    Dec Var.

    X1

    X2
    100

    OBJ FUN.

    20

    Profit max
    28000

    Subject to:
    260 <=
    140 <=
    100 >=
    20 >=

    260
    140
    20
    20

    X1
    X2

    No. of generators
    No. of alternators

    Dec. Var.

    X1

    X2
    0.5

    OBJ. FUN
    MIN:

    0.5

    0.75

    Subject to:
    0.25 <=
    0.75 >=

    0.25
    0.75

    Dec. Var

    X1

    X2
    240

    OBJ. FUN

    420

    Profit Max.
    33600

    Subject to:
    660 <=
    -180 <=
    900 <=
    2400 <=

    700
    300
    900
    2400

    Dec. Var.

    X1

    X2
    100

    Revenue
    Cost
    Profit

    500

    82400
    23100
    59300 MAX.

    Subject to:
    15000 <=
    600 <=
    2000 <=

    15000
    600
    3000

    Dec. Var.

    X1

    X2
    60

    Revenue
    Cost
    Profit

    40

    28200
    1460
    26740 MAX.

    Subject to:
    6000 <=
    100 <=

    6000
    100

    Dec. Var.

    X1

    X2
    20

    OBJ FUN.
    MAX:

    40

    Profit Max.
    26000

    Subject to:
    40 <=
    40 <=
    50 <=

    40
    40
    60

    Dec. Var.

    X1

    X2
    38

    OBJ. FUN
    MAX:

    75

    90000

    Subject to:
    38 <=
    75 <=
    300 <=

    80
    75
    300

    Dec. Var.

    X1

    X2
    4

    OBJ FUN.
    MIN:

    Cost Min.
    3500000

    Subject to:
    0.14 >=
    0.04 >=
    0.04 >=

    0.14
    0.04
    0.03

    You might also like