Scribd
Upload
1 views4 pages

Duality in Linear Programming

Duality in linear programming allows for the analysis of problems in two ways: as primal and dual linear programming problems, which yield equivalent solutions. The document outlines steps for converting a standard primal form into its dual, including changes to the objective function, constraints, and variable representation. It also provides rules for transforming a standard primal LPP into its dual LPP, emphasizing the need to switch maximization to minimization and adjust coefficients accordingly.

Uploaded by

mamathaduppatla172
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views4 pages

Duality in Linear Programming

Duality in linear programming allows for the analysis of problems in two ways: as primal and dual linear programming problems, which yield equivalent solutions. The document outlines steps for converting a standard primal form into its dual, including changes to the objective function, constraints, and variable representation. It also provides rules for transforming a standard primal LPP into its dual LPP, emphasizing the need to switch maximization to minimization and adjust coefficients accordingly.

Uploaded by

mamathaduppatla172
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Duality in Linear Programming

Duality implies that each linear programming problem can be analysed in two
different ways (as primal and dual LPP), which have equivalent solutions.
Mirror Image of LPP is said to be its dual
We do opposite of everything

Steps for a Standard primal Form: -


1. Change the objective function to Maximization Form.
2. If the constraints have an inequality sign'>=' the convert into '<='
3. If the constraint has an '=' sign then replace it by two constraints involving the
inequalities going in opposite directions.
4. Every unrestricted variable is replaced by the difference of two non-negative
variables.
5. Standard primal form of the given LPP in which-
NOTE

(i) All constraints have '<=' sign, where the objective function is of Maximization
form
(ii) All constraints have '>=' sign, where the objective function is of Minimization
form.
(iii) If the constraints are equal type “=” than we have to take 2 equations in that
place, one with '<=' sign and another with '>=' sign
Problem
Convert the following LPP to Standard primal Form

Rules for converting Standard Primal LPP into its Dual LPP

1. Convert max into min or min into max


2. Write the co-efficient of variables of objective function in the place of
constraints and vice versa (Transpose the co-efficient of the objective
function and the right-side constants.)
3. Change the inequalities from '<=' to '>=' sign and vice versa
4. Transpose the rows and columns of the constraint co-efficient.

You might also like