Scribd Logo
Upload

Welcome to Scribd!

  • 44 views

    Solving Minimization Problems

    Uploaded by

    Manav
    To solve a minimization problem, it is first converted to an equivalent maximization problem by replacing the objective with its negative. The maximization problem is then solved using the simplex method. This example problem minimizes c=2000x+3000y subject to constraints. The equivalent maximization problem maximizes p=-2000x-3000y subject to the same constraints. The initial simplex tableau is set up with the constraints and maximized objective, and then the simplex method is applied in the usual way to find the optimal solution.

    Copyright:

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

    Solving Minimization Problems

    Uploaded by

    Manav
    44 views5 pages
    To solve a minimization problem, it is first converted to an equivalent maximization problem by replacing the objective with its negative. The maximization problem is then solved using the simplex method. This example problem minimizes c=2000x+3000y subject to constraints. The equivalent maximization problem maximizes p=-2000x-3000y subject to the same constraints. The initial simplex tableau is set up with the constraints and maximized objective, and then the simplex method is applied in the usual way to find the optimal solution.

    Original Description:

    Minimization LLP

    Original Title

    Minimization LLP

    Copyright

    © © All Rights Reserved

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    To solve a minimization problem, it is first converted to an equivalent maximization problem by replacing the objective with its negative. The maximization problem is then solved using the simplex method. This example problem minimizes c=2000x+3000y subject to constraints. The equivalent maximization problem maximizes p=-2000x-3000y subject to the same constraints. The initial simplex tableau is set up with the constraints and maximized objective, and then the simplex method is applied in the usual way to find the optimal solution.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    44 views5 pages

    Solving Minimization Problems

    Uploaded by

    Manav
    To solve a minimization problem, it is first converted to an equivalent maximization problem by replacing the objective with its negative. The maximization problem is then solved using the simplex method. This example problem minimizes c=2000x+3000y subject to constraints. The equivalent maximization problem maximizes p=-2000x-3000y subject to the same constraints. The initial simplex tableau is set up with the constraints and maximized objective, and then the simplex method is applied in the usual way to find the optimal solution.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    You are on page 1of 5

    Solving minimization problems

    To solve a minimzation problem, we first convert it into a maximization problem by replacing the objective by its negative
    and then follow the procedure shown in the "Maximization problem" worksheet.
    Converting a minimization problem to a maximization problem
    Here is an example, based on Example 3 in the text.

    Minimization Problem Maximization Problem


    Minimize c = 2000x + 3000y subject to Maximize p = -2000x - 3000y subject to
    20x + 10y >= 200 20x + 10y >= 200
    25x + 50y >= 500 25x + 50y >= 500
    18x + 24y >= 300 18x + 24y >= 300
    x >= 0, y >= 0 x >= 0, y >= 0

    Setting Up the Initial Tableau


    Now we set up the initial tableau for the associated maximizatoin problem, and solve it as in the previous worksheet.
    20x + 10y -s = 200 we subtracted a surplus variable
    25x + 50y -t = 500 we subtracted a surplus variable
    18x + 24y -u = 300 we subtracted a surplus variable
    2000x + 3000y +p =0 note that the signs of the obtjective revert back to the original on

    Now Enter this in matrix form by filling in the blank entries below to get the first tableau.
    Then proceed with the simplex method as usual, following Phases 1 and 2 (as in the previous worksheet).

    x y s t u p

    Basic Solution (All variables not on this list are zero)


    0 = 0
    0 = 0
    0 = 0
    0 = 0 c = 0

    Value of maximized objective Value of minimized (original) objective


    cing the objective by its negative

    000x - 3000y subject to

    as in the previous worksheet.

    ective revert back to the original ones

    vious worksheet).

    Ans
    x
    150 x 150
    300 y 0
    2 t 0
    3 p 0
    1

    1
    =
    5
    160
    -4800
    y s t u p Ans
    0 -12 0 5 0 900
    150 9 0 -10 0 1200
    0 2 2 -5 0 100
    0 -60 0 400 3 -108000
    -1
    -4
    2

    You might also like