Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Mip001 Problema 1

    Uploaded by

    Lucia Llamera
    This document describes solving a linear programming problem using the simplex method and graphical solution, then applying branch and bound to find the optimal mixed integer programming solution. It presents: 1) A maximization problem with two variables and constraints that is solved using simplex starting from (0,0) to find an optimal value of 8.8. 2) Graphically depicting the feasible region and optimal solution of (3,2) and (5.6). 3) Applying branch and bound to partition the space and determine the optimal integer solution is (3,5).

    Copyright:

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

    Mip001 Problema 1

    Uploaded by

    Lucia Llamera
    12 views3 pages
    This document describes solving a linear programming problem using the simplex method and graphical solution, then applying branch and bound to find the optimal mixed integer programming solution. It presents: 1) A maximization problem with two variables and constraints that is solved using simplex starting from (0,0) to find an optimal value of 8.8. 2) Graphically depicting the feasible region and optimal solution of (3,2) and (5.6). 3) Applying branch and bound to partition the space and determine the optimal integer solution is (3,5).

    Original Title

    MIP001 PROBLEMA 1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes solving a linear programming problem using the simplex method and graphical solution, then applying branch and bound to find the optimal mixed integer programming solution. It presents: 1) A maximization problem with two variables and constraints that is solved using simplex starting from (0,0) to find an optimal value of 8.8. 2) Graphically depicting the feasible region and optimal solution of (3,2) and (5.6). 3) Applying branch and bound to partition the space and determine the optimal integer solution is (3,5).

    Copyright:

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

    Mip001 Problema 1

    Uploaded by

    Lucia Llamera
    This document describes solving a linear programming problem using the simplex method and graphical solution, then applying branch and bound to find the optimal mixed integer programming solution. It presents: 1) A maximization problem with two variables and constraints that is solved using simplex starting from (0,0) to find an optimal value of 8.8. 2) Graphically depicting the feasible region and optimal solution of (3,2) and (5.6). 3) Applying branch and bound to partition the space and determine the optimal integer solution is (3,5).

    Copyright:

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

    MIP001 : SIMPLEX Y LINEAL ENTERA

    a) Solve the following problem assuming positive continuous variables using the simplex method and starting
    from the initial vertex (x,y)=(0,0)
    Max x+y
    -x+2y ≤8
    2x+y≤12
    x,y≥0

    b) Solve the problem graphically and apply the branch and bound method to obtain the optimal MIP solution.
    MIP001 : SIMPLEX Y LINEAL ENTERA
    a) Solve the following problem assuming positive continuous variables using the simplex method and starting
    from the initial vertex (x,y)=(0,0)
    Max x+y
    -x+2y +h1 = 8
    2x+y + h2=12
    x,y,h1,h2≥0
    h1 h2 x y h1 x h2 y y x h2 h1
    B N B N B N
    1 0 -1 2 Max 1 -1 0 2 Max 2 -1 0 1 Max
    0 1 2 1 0 2 1 1 1 2 1 0

    CB CN CB CN
    CB CN
    0,0 0 1 1 0 1 0 1
    1 1 0 0

    B-1 b B-1 b B-1 b


    1 0 8 h1 8 1 0,5 8 h1 14 0,4 0,2 8 y 5,6
    0 1 12 h2 12 0 0,5 12 x 6 -0,2 0,4 12 x 3,2

    of 0 of 6 of 8,8

    B-1N B-1N
    B-1N
    x y b/y h2 y b/y
    h2 h1 b/y
    -1 2 8 -1 -8 h1 0,5 2,5 14 2,5 5,6 h1
    0,2 0,4 5,6 0 y
    2 1 12 2 6 h2 0,5 0,5 6 0,5 12 x
    0,4 -0,2 3,2 0 x

    ^Cn ^Cn ^Cn


    1,00 1,00 -0,50 0,50 -0,60 -0,20
    x y h2 y h2 h1
    MIP001 : SIMPLEX Y LINEAL ENTERA
    b) Solve the problem graphically and apply the branch and bound method to obtain the optimal MIP solution.

    Max x+y
    -x+2y +h1 = 8
    2x+y + h2=12
    x,y,h1,h2≥0

    Z=8,8
    (x,y)=(3,2 , 5,6)
    x≤3 x≥4

    Z=8,5 Z=8
    (x,y)=(3 , 5,5) (x,y)=(4 , 4)
    y≤5 y≥6

    Z=8 No factible
    (x,y)=(3 , 5)

    You might also like