Nothing Special   »   [go: up one dir, main page]
Scribd Logo
Upload

Welcome to Scribd!

  • 43 views

    B. Maximizar Z 2X1+3X2 Sujeto A 5X1+7X2 0 y Entera

    Uploaded by

    Dianira Cabanillas Montenegro
    The document describes several linear programming problems with the following structure: 1) Define the objective function to maximize or minimize and constraints 2) Present the subproblems analyzed by restricting values of the variables 3) Provide the optimal solution found for each subproblem including the objective value and values of variables

    Copyright:

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

    B. Maximizar Z 2X1+3X2 Sujeto A 5X1+7X2 0 y Entera

    Uploaded by

    Dianira Cabanillas Montenegro
    43 views5 pages
    The document describes several linear programming problems with the following structure: 1) Define the objective function to maximize or minimize and constraints 2) Present the subproblems analyzed by restricting values of the variables 3) Provide the optimal solution found for each subproblem including the objective value and values of variables

    Original Description:

    Original Title

    EXAMEN-5 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes several linear programming problems with the following structure: 1) Define the objective function to maximize or minimize and constraints 2) Present the subproblems analyzed by restricting values of the variables 3) Provide the optimal solution found for each subproblem including the objective value and values of variables

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    43 views5 pages

    B. Maximizar Z 2X1+3X2 Sujeto A 5X1+7X2 0 y Entera

    Uploaded by

    Dianira Cabanillas Montenegro
    The document describes several linear programming problems with the following structure: 1) Define the objective function to maximize or minimize and constraints 2) Present the subproblems analyzed by restricting values of the variables 3) Provide the optimal solution found for each subproblem including the objective value and values of variables

    Copyright:

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

    A.

    maximizar Z= 2X1+3X2

    B. Maximizar Z= 2X1+3X2
    Sujeto a
    5X1+7X2<=35
    4X1+9X2<=36
    X1,X2>=0 y entera
    Subproblema 1
    Z= 14,47
    X1=3,71
    X2=2,35

    X1>=4 X1<=3 

    Subproblema 2 Subproblema 3
    Z= 14,43 Z= 14
    X1=4 X1=3
    X2=2,14 X2=2,67
       

    X2>=3 X2<=2 X2>=3  X2<=2


    Subproblema 5 Subproblema 14 Subproblema 15
    Subproblema 4 Z= 14,4 Z= 13.5 Z= 12
    No factible X1=4,2 X1=2.25 X1=3
      X2=2 X2=3 X2=2
         

    X1<=4 X1>=3  X1<=2


    X1>=5
    Subproblema 6 Subproblema 7 Subproblema 17
    Z= 14,29 Z= 14 Subproblema 16 Z= 13,33
    X1=5 X1=4 No factible  X1=2
    X2=1,43 X2=2 X2=3,11
         

    X2>=2 X2<=1 X2>=4 X2<=3


    Subproblema 9 Subproblema 18 Subproblema 19
    Subproblema 8
    Z= 14,2 Z= 12 Z= 13
    No factible
    X1=5,6 X1=0 X1=2
     
    X2=1 X2=4 X2=3
         

    X1>=6 X1<=5
    Subproblema 10 Subproblema 11
    Z= 14,14 Z= 13
    X1=6 X1=5
    X2=0,71 X2=1
       

    X2<=1 X2<=0
    Subproblema 13
    Subproblema 12 Z= 14
     No factible X1=7
    X2=0
     
    C. Maximizar X1+X2
    Sujeto a
    2X1+5X2<=16
    6X1+5X2<=27
    X1; X2>=0

    Subproblema 1
    Z= 4.85
    X1=2.75
    X2=2.1

    X1>=3 X1<=2 

    Subproblema 2
    Z= 4.8 Subproblema 3
    X1=3  No factible 
    X2=1.8
     
    X2>=2 X2<=1

    Subproblema 4 Subproblema 5
    No factible No factible 
     
     

    D. Minimizar Z= 5X1+4X2
    Sujeto a
    3X1+2X2>=5
    2X1+3X2>=7
    X1,X2>=0 y entera

    Subproblema 1
    Z= 9,8
    X1=0,2
    X2=2,2

    X1>=1 X1<=0 
    Subproblema 2 Subproblema 3
    Z= 11,67 Z= 10
    X1=1 X1=0
    X2=1,67 X2=2,5
       

    X2>=2 X2<=1 X2>=3  X2<=2


    Subproblema 5 Subproblema 14
    Subproblema 9
    Z= 14 Z= 12
    Z= 13 Subproblema 16
    X1=2 X1=0
    X1=1
    E. Maximizar 5X1+7X2 No factible 
    X2=1 X2=3
    X2=2
    Sujeto a
       
     2X1+X2<=13
    5X1+9X2<=41
    X2<=1
    X1; X2>=0

    Subproblema 1
    Z= 38.38462
    X1=5.846154
    X2=1.30

    X1>=6 X1<=5

    Subproblema 2
    Z= 37 Subproblema 3
    X1=6 No factible
    X2=1  
     

    You might also like