Home / GATE 2017-2018 / GATE Mathematics :: Discussion

Discussion :: GATE Mathematics

  1. For the linear programming problem 
    Maximize z = x1 + 2x2 + 3x3 - 4x4 
    Subject to      2x1 + 3x2 - x3 - x4 = 15  
                           6x1 + x2 + x3 - 3x4 = 21 
                           8x1 + 2x2 + 3x3 - 4x4 = 30 
                           x1, x2, x3, x4 ≥ 0, 
    x1 = 4, x2 = 3, x3 = 0, x4 = 2 is
  2. A.
    an optimal solution
    B.
    a degenerate basic feasible solution
    C.
    a non-degenerate basic feasible solution
    D.
    a non-basic feasible solution

    View Answer

    Workspace

    Answer : Option D

    Explanation :

    -NA-


Be The First To Comment