Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Value 1 0 1 0 1 0 0 1 0 700

    Uploaded by

    Carlos Alcántara
    The document summarizes the results of an integer and mixed integer programming problem called "CostoMinimo" with the objective of minimizing costs. The optimal solution was found after 1 iteration with a value of 700. The solution has X1, X3, X5 and X8 set to 1 and the rest set to 0. The original problem consisted of minimizing costs subject to 6 constraints over 9 integer variables.

    Copyright:

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

    Value 1 0 1 0 1 0 0 1 0 700

    Uploaded by

    Carlos Alcántara
    27 views1 page
    The document summarizes the results of an integer and mixed integer programming problem called "CostoMinimo" with the objective of minimizing costs. The optimal solution was found after 1 iteration with a value of 700. The solution has X1, X3, X5 and X8 set to 1 and the rest set to 0. The original problem consisted of minimizing costs subject to 6 constraints over 9 integer variables.

    Original Title

    CostoMin

    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 summarizes the results of an integer and mixed integer programming problem called "CostoMinimo" with the objective of minimizing costs. The optimal solution was found after 1 iteration with a value of 700. The solution has X1, X3, X5 and X8 set to 1 and the rest set to 0. The original problem consisted of minimizing costs subject to 6 constraints over 9 integer variables.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views1 page

    Value 1 0 1 0 1 0 0 1 0 700

    Uploaded by

    Carlos Alcántara
    The document summarizes the results of an integer and mixed integer programming problem called "CostoMinimo" with the objective of minimizing costs. The optimal solution was found after 1 iteration with a value of 700. The solution has X1, X3, X5 and X8 set to 1 and the rest set to 0. The original problem consisted of minimizing costs subject to 6 constraints over 9 integer variables.

    Copyright:

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

    Román Bautista Miguel Ángel

    Carlos Alcántara Inv. Operaciones II


    C:\Users\lmlal\Downloads\CostoMinimo.mix
    Module/submodel: Integer && Mixed Integer Programming
    Problem title: CostoMinimo
    Maximum number of iterations: 1000
    Maximum level (depth) in procedure: 50
    Objective: Minimize

    Integer && Mixed Integer Programming Results


    Variable Type Value

    X1 Integer 1

    X2 Integer 0

    X3 Integer 1

    X4 Integer 0

    X5 Integer 1

    X6 Integer 0

    X7 Integer 0

    X8 Integer 1

    X9 Integer 0

    Solution value 700

    Iteration Results
    Iteratio Added Solutio Solutio
    Level X1 X2 X3 X4 X5 X6 X7 X8 X9
    n const… n type n Value
    Optima
    700 1 0 1 0 1 0 0 1 0
    l
    INTEG
    1 0 700 1 0 1 0 1 0 0 1 0
    ER

    Original Problem with solution


    X1 X2 X3 X4 X5 X6 X7 X8 X9 RHS

    Minimize 250 400 100 300 150 275 100 200 150

    Constraint 1 1 1 0 0 0 0 0 0 0 = 1

    Constraint 2 1 0 -1 -1 0 0 0 0 0 = 0

    Constraint 3 0 1 1 0 -1 -1 0 0 0 = 0

    Constraint 4 0 0 0 1 1 0 1 -1 0 = 0

    Constraint 5 0 0 0 0 0 1 -1 0 -1 = 0

    Constraint 6 0 0 0 0 0 0 0 1 1 = 1

    Variable type Integer Integer Integer Integer Integer Integer Integer Integer Integer

    Solution-> 1 0 1 0 1 0 0 1 0 Optimal Z-> 700

    miércoles, 9 de octubre de 2019 07:53 p. m. 1 of 1

    You might also like