MECH SHALA's video: Duality in linear programming

duality in linear programming, duality theorem, dual of simplex, duality in operation research, how to solve a lp by dual, conversion into dual, primal to dual, lecture on duality The Duality in Linear Programming states that every linear programming problem has another linear programming problem related to it and thus can be derived from it. The original linear programming problem is called “Primal,” while the derived linear problem is called “Dual. The following observations were made while forming the dual linear programming problem: 1. The primal or original linear programming problem is of the maximization type while the dual problem is of minimization type. 2. The constraint values of the primal problem have become the coefficient of dual variables in the objective function of a dual problem and while the coefficient of the variables in the objective function of a primal problem has become the constraint value in the dual problem. 3. The first column in the constraint inequality of primal problem has become the first row in a dual problem and similarly the second column of constraint has become the second row in the dual problem. 4. The directions of inequalities have also changed, i.e. in the dual problem, the sign is the reverse of a primal problem. Such that in the primal problem, the inequality sign was “≤” but in the dual problem, the sign of inequality becomes “≥”. Note: The dual of a dual problem is the primal problem.