Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    4 LP A Clever Partition

    Uploaded by

    Maya Peleg
    The document discusses basic feasible solutions and optimality in linear programming problems. It explains that a basic feasible solution is a feasible solution where the number of non-zero variables is equal to the number of constraints. An optimal solution is a basic feasible solution that maximizes or minimizes the objective function over the entire feasible region. The document uses examples to illustrate basic feasible solutions, optimality, and how to identify an optimal solution using a simplex tableau and pivoting to systematically improve the objective function value.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    4 LP A Clever Partition

    Uploaded by

    Maya Peleg
    12 views95 pages
    The document discusses basic feasible solutions and optimality in linear programming problems. It explains that a basic feasible solution is a feasible solution where the number of non-zero variables is equal to the number of constraints. An optimal solution is a basic feasible solution that maximizes or minimizes the objective function over the entire feasible region. The document uses examples to illustrate basic feasible solutions, optimality, and how to identify an optimal solution using a simplex tableau and pivoting to systematically improve the objective function value.

    Original Description:

    Original Title

    4 LP a Clever Partition

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses basic feasible solutions and optimality in linear programming problems. It explains that a basic feasible solution is a feasible solution where the number of non-zero variables is equal to the number of constraints. An optimal solution is a basic feasible solution that maximizes or minimizes the objective function over the entire feasible region. The document uses examples to illustrate basic feasible solutions, optimality, and how to identify an optimal solution using a simplex tableau and pivoting to systematically improve the objective function value.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views95 pages

    4 LP A Clever Partition

    Uploaded by

    Maya Peleg
    The document discusses basic feasible solutions and optimality in linear programming problems. It explains that a basic feasible solution is a feasible solution where the number of non-zero variables is equal to the number of constraints. An optimal solution is a basic feasible solution that maximizes or minimizes the objective function over the entire feasible region. The document uses examples to illustrate basic feasible solutions, optimality, and how to identify an optimal solution using a simplex tableau and pivoting to systematically improve the objective function value.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 95

    Basic Feasible Solutions and Optimality

    Antonio J. Conejo, 2018


    What

    September 13, 2018 A. J. Conejo 2


    The Partition

    September 13, 2018 A. J. Conejo 3


    First, the feasibility region

    September 13, 2018 A. J. Conejo 4


    The Partition

    September 13, 2018 A. J. Conejo 5


    The Partition

    September 13, 2018 A. J. Conejo 6


    The Partition

    September 13, 2018 A. J. Conejo 7


    The Partition

    September 13, 2018 A. J. Conejo 8


    The Partition

    September 13, 2018 A. J. Conejo 9


    Then, the objective function

    September 13, 2018 A. J. Conejo 10


    Consistent
    partition
    The Partition

    September 13, 2018 A. J. Conejo 11


    The Partition

    September 13, 2018 A. J. Conejo 12


    The Partition

    September 13, 2018 A. J. Conejo 13


    The Partition

    September 13, 2018 A. J. Conejo 14


    The Partition

    Basic form

    September 13, 2018 A. J. Conejo 15


    Standard
    The Partition form

    Please… review your


    algebra

    Basic
    form

    September 13, 2018 A. J. Conejo 16


    Standard
    The Partition form

    Basic
    form

    September 13, 2018 A. J. Conejo 17


    Connecting the dots

    September 13, 2018 A. J. Conejo 18


    Connecting the dots

    September 13, 2018 A. J. Conejo 19


    The Partition Basic
    form

    September 13, 2018 A. J. Conejo 20


    The Partition
    basic solution

    September 13, 2018 A. J. Conejo 21


    The Partition Basic
    form

    September 13, 2018 A. J. Conejo 22


    Basic
    The Partition form

    September 13, 2018 A. J. Conejo 23


    The Partition

    September 13, 2018 A. J. Conejo 24


    The Partition: example

    September 13, 2018 A. J. Conejo 25


    The Partition

    September 13, 2018 A. J. Conejo 26


    The Partition

    September 13, 2018 A. J. Conejo 27


    The Partition

    September 13, 2018 A. J. Conejo 28


    The Partition

    September 13, 2018 A. J. Conejo 29


    The Partition

    September 13, 2018 A. J. Conejo 30


    Octave
    The Partition

    Octave

    September 13, 2018 A. J. Conejo 31


    The Partition
    Octave

    September 13, 2018 A. J. Conejo 32


    The Partition Basic
    form

    September 13, 2018 A. J. Conejo 33


    The Partition

    Basic
    form
    September 13, 2018 A. J. Conejo 34
    The Partition

    September 13, 2018 A. J. Conejo 35


    The Partition

    September 13, 2018 A. J. Conejo 36


    Identity matrix

    The Partition Null

    September 13, 2018 A. J. Conejo 37


    The Partition: example
    “Canonical”
    form

    September 13, 2018 A. J. Conejo 38


    The Partition
    Standard form

    September 13, 2018 A. J. Conejo 39


    The Partition

    September 13, 2018 A. J. Conejo 40


    0
    The Partition

    Identity matrix

    September 13, 2018 A. J. Conejo 41


    The Partition 0

    Identity matrix

    September 13, 2018 A. J. Conejo 42


    The Partition

    September 13, 2018 A. J. Conejo 43


    The Partition

    September 13, 2018 A. J. Conejo 44


    The Partition

    September 13, 2018 A. J. Conejo 45


    The Partition

    Slack variables as a function of the other variables

    September 13, 2018 A. J. Conejo 46


    The Partition

    Basic form!

    September 13, 2018 A. J. Conejo 47


    The Partition

    September 13, 2018 A. J. Conejo 48


    The Partition

    September 13, 2018 A. J. Conejo 49


    The Tableau

    September 13, 2018 A. J. Conejo 50


    Basic
    The Tableau form

    September 13, 2018 A. J. Conejo 51


    The Tableau

    September 13, 2018 A. J. Conejo 52


    September 13, 2018 A. J. Conejo 53
    The Tableau

    September 13, 2018 A. J. Conejo 54


    The Tableau

    September 13, 2018 A. J. Conejo 55


    1) If we make this zero
    (non-basic variables)
    The Tableau

    2) This does not count


    September 13, 2018 A. J. Conejo 56
    The Tableau

    September 13, 2018 A. J. Conejo 57


    The Tableau: electricity production example

    September 13, 2018 A. J. Conejo 58


    The Tableau

    September 13, 2018 A. J. Conejo 59


    The Tableau

    September 13, 2018 A. J. Conejo 60


    The Tableau

    September 13, 2018 A. J. Conejo 61


    The Tableau

    September 13, 2018 A. J. Conejo 62


    Pivoting

    September 13, 2018 A. J. Conejo 63


    Pivoting

    September 13, 2018 A. J. Conejo 64


    Pivoting

    September 13, 2018 A. J. Conejo 65


    Pivoting

    September 13, 2018 A. J. Conejo 66


    Pivoting NO
    “N”
    “B”
    NO

    September 13, 2018 A. J. Conejo 67


    Pivoting
    1

    This!

    September 13, 2018 A. J. Conejo 68


    Pivoting 2

    September 13, 2018 A. J. Conejo 69


    Pivoting
    3

    September 13, 2018 A. J. Conejo 70


    Pivoting 4

    September 13, 2018 A. J. Conejo 71


    Pivoting
    5

    September 13, 2018 A. J. Conejo 72


    Pivoting 6

    September 13, 2018 A. J. Conejo 73


    Pivoting
    7

    September 13, 2018 A. J. Conejo 74


    Pivoting 8

    September 13, 2018 A. J. Conejo 75


    Pivoting 9

    September 13, 2018 A. J. Conejo 76


    Pivoting

    September 13, 2018 A. J. Conejo 77


    function B = pivot(A,r,s)
    % function pivot performs a pivot operation on m-by-n
    matrix A
    Pivoting: Octave % swapping row r and column s
    clc
    [m n]=size(A);
    %
    for i = 1:m
    if i == r
    for j = 1:n
    if j == s
    B(i,j)=1/A(r,s);
    else
    B(i,j)=-A(r,j)/A(r,s);
    end
    end
    else
    for j = 1:n
    if j == s
    B(i,j)=A(i,s)/A(r,s);
    else
    B(i,j)=A(i,j)-A(i,s)*(A(r,j))/(A(r,s));
    end
    end
    end
    %
    September 13, 2018 end A. J. Conejo 78
    Example

    September 13, 2018 A. J. Conejo 79


    Pivoting example

    September 13, 2018 A. J. Conejo 80


    Pivoting example

    September 13, 2018 A. J. Conejo 81


    Pivoting example

    September 13, 2018 A. J. Conejo 82


    Pivoting example

    September 13, 2018 A. J. Conejo 83


    Pivoting example
    Next we considerer xB1

    September 13, 2018 A. J. Conejo 84


    Pivoting example
    Next we considerer xB2

    September 13, 2018 A. J. Conejo 85


    Pivoting example
    Next we considerer xB4

    September 13, 2018 A. J. Conejo 86


    Pivoting
    example

    September 13, 2018 A. J. Conejo 87


    Pivoting example

    September 13, 2018 A. J. Conejo 88


    Pivoting example

    September 13, 2018 A. J. Conejo 89


    Pivoting

    September 13, 2018 A. J. Conejo 90


    Pivoting

    September 13, 2018 A. J. Conejo 91


    function B = pivot(A,r,s)
    % function pivot performs a pivot operation on m-by-n
    matrix A
    Pivoting: Octave % swapping row r and column s
    clc
    [m n]=size(A);
    %
    for i = 1:m
    if i == r
    for j = 1:n
    if j == s
    B(i,j)=1/A(r,s);
    else
    B(i,j)=-A(r,j)/A(r,s);
    end
    end
    else
    for j = 1:n
    if j == s
    B(i,j)=A(i,s)/A(r,s);
    else
    B(i,j)=A(i,j)-A(i,s)*(A(r,j))/(A(r,s));
    end
    end
    end
    %
    September 13, 2018 end A. J. Conejo 92
    With Octave

    September 13, 2018 A. J. Conejo 93


    With Octave

    September 13, 2018 A. J. Conejo 94


    This is it!

    September 13, 2018 A. J. Conejo 95

    You might also like