Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    IE400 StudySet2 Key

    Uploaded by

    yigityalin02
    This document contains sample questions and solutions for an engineering management principles course. It includes: 1) Seven questions about basic feasible solutions and determining if a proposed solution meets the criteria. 2) Two questions involving converting a linear program into standard form and using the simplex method to solve it. 3) A question about interpreting potential outcomes based on values in a simplex tableau. 4) Two investment planning questions that set up linear programs to maximize profits based on investing and borrowing constraints. 5) A final question exploring the feasible region of a two-variable minimization problem and determining if there are alternative optimal solutions.

    Copyright:

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

    IE400 StudySet2 Key

    Uploaded by

    yigityalin02
    8 views17 pages
    This document contains sample questions and solutions for an engineering management principles course. It includes: 1) Seven questions about basic feasible solutions and determining if a proposed solution meets the criteria. 2) Two questions involving converting a linear program into standard form and using the simplex method to solve it. 3) A question about interpreting potential outcomes based on values in a simplex tableau. 4) Two investment planning questions that set up linear programs to maximize profits based on investing and borrowing constraints. 5) A final question exploring the feasible region of a two-variable minimization problem and determining if there are alternative optimal solutions.

    Original Title

    IE400_StudySet2_Key

    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 contains sample questions and solutions for an engineering management principles course. It includes: 1) Seven questions about basic feasible solutions and determining if a proposed solution meets the criteria. 2) Two questions involving converting a linear program into standard form and using the simplex method to solve it. 3) A question about interpreting potential outcomes based on values in a simplex tableau. 4) Two investment planning questions that set up linear programs to maximize profits based on investing and borrowing constraints. 5) A final question exploring the feasible region of a two-variable minimization problem and determining if there are alternative optimal solutions.

    Copyright:

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

    IE400 StudySet2 Key

    Uploaded by

    yigityalin02
    This document contains sample questions and solutions for an engineering management principles course. It includes: 1) Seven questions about basic feasible solutions and determining if a proposed solution meets the criteria. 2) Two questions involving converting a linear program into standard form and using the simplex method to solve it. 3) A question about interpreting potential outcomes based on values in a simplex tableau. 4) Two investment planning questions that set up linear programs to maximize profits based on investing and borrowing constraints. 5) A final question exploring the feasible region of a two-variable minimization problem and determining if there are alternative optimal solutions.

    Copyright:

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

    IE 400: Principles of Engineering Management

    Solutions for Graphical Solutions and Simplex


    Algorithm
    Fall 2023

    1
    Question 1.

    2
    Question 2.

    3
    Question 3.

    4
    Question 4.

    5
    Question 5.

    6
    Question 6.

    Question 7.

    •
    x1 , x2 basic,
    x3 , x4 nonbasic (x3 = 0, x4 = 0)
    Then,
    x1 − x2 = 15
    x1 + x2 = 9

    7
    Solving this system, we obtain x = (12, −3, 0, 0). This is basic but not
    feasible since x2 = −3 < 0.

    •
    x1 , x3 basic,
    x2 , x4 nonbasic (x2 = 0, x4 = 0)
    Then,

    x1 + 3x3 = 15
    x1 = 9

    Solving this system, we obtain x = (9, 0, 2, 0). This is a basic feasible


    solution.

    •
    x1 , x4 basic,
    x2 , x3 nonbasic (x2 = 0, x3 = 0)
    Then,

    x1 + 5x4 = 15
    x1 + x4 = 9

    Solving this system, we obtain x = (15/2, 0, 0, 3/2). This is a basic


    feasible solution.

    •
    x2 , x3 basic,
    x1 , x4 nonbasic (x1 = 0, x4 = 0)
    Then,

    − x2 + 3x3 = 15
    x2 = 9

    Solving this system, we obtain x = (0, 9, 8, 0). This is a basic feasible


    solution.

    •
    x2 , x4 basic,

    8
    x1 , x3 nonbasic (x1 = 0, x3 = 0)
    Then,

    − x2 + 5x4 = 15
    x2 + x4 = 9

    Solving this system, we obtain x = (0, 5, 0, 4). This is a basic feasible


    solution.

    •
    x3 , x4 basic,
    x1 , x2 nonbasic (x1 = 0, x2 = 0)
    Then,

    3x3 + 5x4 = 15
    x4 = 9

    Solving this system, we obtain x = (0, 0, −10, 9). This is basic but not
    feasible since x3 = −10 < 0.

    Question 8.
    First convert the LP into standard form:

    max 5x1 + 3x2 + x3


    s.t. x1 + x2 + 3x3 + s1 = 6
    5x1 + 3x2 + 6x3 + s2 = 15
    xi ≥ 0 i = 1, 2, 3
    s1 , s2 ≥ 0

    z x1 x2 x3 s1 s2 RHS
    1 1 -5 -3 -1 0 0 0
    s1 0 1 1 3 1 0 6
    s2 0 5 3 6 0 1 15

    x1 enters. Apply MRT: min{6/1, 15/5}=3 Hence, s2 leaves.

    9
    z x1 x2 x3 s 1 s2 RHS
    1 1 0 0 5 0 1 15
    s1 0 0 2/5 9/5 1 -1/5 3
    x1 0 1 3/5 6/5 0 1/5 3

    Since there is no negative row 0 coefficient, the solution is optimal: x∗ =


    (3, 0, 0) and z ∗ = 15.
    Since there exists 0 in row 0, there may be alternative optimal solutions:
    3 3
    Let x2 enter the basis. Apply MRT: min{ 2/5 , 3/5 } = 5. Then x1 leaves.

    z x1 x2 x3 s1 s2 RHS
    1 1 0 0 5 0 1 15
    s1 0 -2/3 0 1 1 -1/3 1
    x2 0 5/3 1 2 0 1/3 5

    x∗ = (0, 5, 0) and z ∗ =15.


    (If x1 enters again, you turn back to the previous tableau!)

    Question 9.
    The LP in the standard form:

    10
    11
    (a) Yes, it is a basic solution. Any tableu solution in proper form will be
    basic, since it corresponds to a basis B.

    (b) Yes, it is a basic feasible solution. All RHS values are nonnegative.

    (c) Yes, it is an optimal BFS. All row zero elements are ≥ 0.

    Question 10.
    Decision Variables:
    x1 : Amount of TLs invested (in millions)
    x2 : Amount of TLs borrowed (in millions)

    12
    13
    Question 11.

    (a) The tableau is final and there exists a unique optimal solution.

    A < 0, B = 0, C any, D ≥ 0, E = 1, F any

    (b) The simplex method determines an unbounded solution from this tableau.

    A > 0, B = 0, C ≤ 0, D ≥ 0, E = 1, F any

    (c) The current bfs is degenerate (not necessarily optimal).

    A any, B = 0, C any, D = 0, E = 1, F any

    (d) d) The current solution is optimal, there are alternative optimal solu-
    tions but no alternative optimal bfs.

    A = 0, B = 0, C ≤ 0, D ≥ 0, E = 1, F any

    14
    Question 12.

    (a)

    (b) As it can be seen from the graph, it is 33/2

    (c) If we add a constraint to the LP, it means that we add new constraint
    line the graph. The result of this optimal solution can not increase, it
    can be same or less that its old value.

    15
    Question 13.

    (a) Feasible region is area painted yellow:

    For alternate solution, there should be a line satisfying all points are
    optimal solution on the line. Since it is a minimization problem, this
    line should lay on the line
    2x1 + x2 = 3
    . So, a=2 and b=1

    16
    (b) λ(0, 3) + (1 − λ)(1.5, 0) λϵ[0, 1]

    (c) It is not possible to have two or integer numbers (except 0 and 1) of optimal
    solutions

    17

    You might also like