SSC Routine 2017 Published PDF

System Analysis Simplex Method.General LP problem is to find the values

  General LP problem is to find the values of X₁,X₂,…..X_n which maximizes (or minimizes) the objective function

  Max (or Min) Z= C₁X₁+C₂X₂+………C_nX_n

  While satisfying the constraints

  a₁₁X₁+…….a_1nX_n             ≤b₁  or  ≥ b₁

  a₂₁X₁+…….a_2nX_n               ≤b₂  or  ≥ b₂

  ……..

  a_m1X₁+…….a_mnX_n ≤b_m or  ≥ b_m

  and    X1, ….Xn     ≥0