How we convert the primal into dual problem in lpp?

Answer 1

To convert a primal linear programming problem into its dual, we first identify the primal's objective function and constraints. If the primal is a maximization problem with ( m ) constraints and ( n ) decision variables, the dual will be a minimization problem with ( n ) constraints and ( m ) decision variables. The coefficients of the primal objective function become the right-hand side constants in the dual constraints, while the right-hand side constants of the primal constraints become the coefficients in the dual objective function. Additionally, the direction of inequalities is reversed: if the primal constraints are ( \leq ), the dual will have ( \geq ) constraints, and vice versa.