Chapter 30: Linear Programming

The general form of linear programming problem is Optimize (Maximize or Minimize) Z = c₁x₁ + c₂x₂ + …... + c_nx_n subject to a₁₁x₁ + a₁₂x₂ + …. + a_1nx_n (≤, =, ≥) b₁ a₂₁x₁ + a₂₂x₂ + …. + a_2nx_n (≤, =, ≥) b_{2 ….. …...  ….…..} a_m1x₁ + a_m2x₂ + …. + a_mnx_n (≤, =, ≥) b_m x₁, x₂, …. , x_n ≥ 0. For more details use the links given below:

Click here → Revision Notes of Linear Programming