Scribd Logo
Upload

Welcome to Scribd!

  • 831 views

    Simplex Method

    Uploaded by

    adlenaeliya
    The document describes several optimization problems involving maximizing or minimizing objectives subject to constraints. Problem 31 involves finding the number of audits and tax returns an accounting firm should take on to maximize revenue given constraints on staff time and review time. Problem 33 involves maximizing an objective function Z=X1+2X2 given the constraints X1-3X2<1 and -X1+2X2<4. Problem 35 involves maximizing the objective function Z=2.5X1+X2 given the constraints 3X1+5X2<15 and 5X1+2X2<10.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Simplex Method

    Uploaded by

    adlenaeliya
    831 views2 pages
    The document describes several optimization problems involving maximizing or minimizing objectives subject to constraints. Problem 31 involves finding the number of audits and tax returns an accounting firm should take on to maximize revenue given constraints on staff time and review time. Problem 33 involves maximizing an objective function Z=X1+2X2 given the constraints X1-3X2<1 and -X1+2X2<4. Problem 35 involves maximizing the objective function Z=2.5X1+X2 given the constraints 3X1+5X2<15 and 5X1+2X2<10.

    Original Title

    SIMPLEX METHOD

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes several optimization problems involving maximizing or minimizing objectives subject to constraints. Problem 31 involves finding the number of audits and tax returns an accounting firm should take on to maximize revenue given constraints on staff time and review time. Problem 33 involves maximizing an objective function Z=X1+2X2 given the constraints X1-3X2<1 and -X1+2X2<4. Problem 35 involves maximizing the objective function Z=2.5X1+X2 given the constraints 3X1+5X2<15 and 5X1+2X2<10.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    831 views2 pages

    Simplex Method

    Uploaded by

    adlenaeliya
    The document describes several optimization problems involving maximizing or minimizing objectives subject to constraints. Problem 31 involves finding the number of audits and tax returns an accounting firm should take on to maximize revenue given constraints on staff time and review time. Problem 33 involves maximizing an objective function Z=X1+2X2 given the constraints X1-3X2<1 and -X1+2X2<4. Problem 35 involves maximizing the objective function Z=2.5X1+X2 given the constraints 3X1+5X2<15 and 5X1+2X2<10.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    MAXIMIZATION

    23. A grower has 50 acres of land for which she plans to raise three crops. It costs $200 to produce an
    acre of carrots and the profit is $60 per acre. It costs $80 to produce an acre of celery and the profit is
    $20 per acre. Finally, it costs $140 to produce an acre of lettuce and the profit is $30 per acre. Use the
    simplex method to find the number of acres of each crop she should plant in order to maximize her
    profit. Assume that her cost cannot exceed $10,000.

    24. A fruit juice company makes two special drinks by blending apple and pineapple juices. The first
    drink uses 30% apple juice and 70% pineapple, while the second drink uses 60% apple and 40%
    pineapple. There are 1000 liters of apple and 1500 liters of pineapple juice available. If the profit for the
    first drink is $0.60 per liter and that for the second drink is $0.50, use the simplex method to find the
    number of liters of each drink that should be produced in order to maximize the profit.

    25. A manufacturer produces three models of bicycles. The time (in hours) required for assembling,
    painting, and packaging each model is as follows.

    Model A Model B Model C


    Assembling 2 2.5 3
    Painting 1.5 2 1
    Packaging 1 0.75 1.25

    31. An accounting firm has 900 hours of staff time and 100 hours of reviewing time available each week.
    The firm charges $2000 for an audit and $300 for a tax return. Each audit requires 100 hours of staff
    time and 10 hours of review time, and each tax return requires 12.5 hours of staff time and 2.5 hours of
    review time. What number of audits and tax returns will bring in a maximum revenue?

    33. (Maximize)-an unbounded solution

    Objective function

    Z= X1 +2X2
    Constraints
    X1 -3X2 <1
    -X1 +2X2 <4
    X 1, X 2 > 0

    35. (Maximize)—optimal solutions

    Objective function

    Z= 2.5X1 +X2
    Constraints
    3X1 +5X2 <15
    5X1 +2X2 <10
    X 1, X 2 > 0
    Computer Exercise

    37. Use a computer to maximize the objective function

    Z= 2X1 +7X2 +6X3 +4X4


    subject to the constraints where
    X1 + X2 + 0.83 X3 + 0.5 X4< 65
    1.2X1 +X2 + X3 + 1.2 X4<96
    0.5X1 +0.7X2 + 1.2 X3 + 0.4 X4<80
    X1, X2 , X3, X4> 0

    MINIMIZATION

    29. A company has three production plants, each of which produces three different models of a
    particular product. The daily capacities (in thousands of units) of the three plants are as follows.

    Model 1 Model 2 Model 3


    Plant 1 8 4 8
    Plant 2 6 6 3
    Plant 3 12 4 8
    The total demand for Model 1 is 300,000 units, for Model 2 is 172,000 units, and for Model 3 is 249,500
    units. Moreover, the daily operating cost for Plant 1 is $55,000, for Plant 2 is $60,000, and for Plant 3 is
    $60,000. How many days should each plant be operated in order to fill the total demand, and keep the
    operating cost at a minimum?

    31. A small petroleum company owns two refineries. Refinery 1 costs $25,000 per day to operate, and it
    can produce 300 barrels of high-grade oil, 200 barrels of medium-grade oil, and 150 barrels of low-grade
    oil each day. Refinery 2 is newer and more modern. It costs $30,000 per day to operate, and it can
    produce 300 barrels of high-grade oil, 250 barrels of medium-grade oil, and 400 barrels of low-grade oil
    each day. The company has orders totaling 35,000 barrels of high-grade oil, 30,000 barrels of medium-
    grade oil, and 40,000 barrels of low-grade oil. How many days should the company run each refinery to
    minimize its costs and still meet its orders?

    32. A steel company has two mills. Mill 1 costs $70,000 per day to operate, and it can produce 400 tons
    of high-grade steel, 500 tons of medium-grade steel, and 450 tons of low-grade steel each day. Mill 2
    costs $60,000 per day to operate, and it can produce 350 tons of high-grade steel, 600 tons of medium-
    grade steel, and 400 tons of low-grade steel each day. The company has orders totaling 100,000 tons of
    high-grade steel, 150,000 tons of medium-grade steel, and 124,500 tons of low-grade steel. How many
    days should the company run each mill to minimize its costs and still fill the orders?

    You might also like