Simplex Method

Conversion of Primal to Dual Method

Dr. Reshma Sinha Ray
Assistant Professor
Dairy Business Management
West Bengal University of Animal and Fishery Sciences
 Introduction
In order to form a simplex problem, we have to follow
three steps.
1. Objective function
(optimization)
2.Constraints
( equality or inequality)
3. Non-negativity restrictions
(value of the variables should be positive)
Example of Simplex Techniques
Objective function
Max Z=6x1+7x2
Constraints:
2x1+3x2≤12
2x1+x2≤8
Non-negativity Restriction
X1≥0, X2 ≥0
.
“Man is simply to recognize that there are different
approaches for solving problems”
Primal Simplex Problem
The original LPP is called primal problem.
Associated with every LPP is always a corresponding
LPP called the dual problem of the given LPP.
The two problems---primal and dual problems can
thus be said to constitute a pair of dual problems.
It will turn out that while solving a LPP by simplex
method, we shall simultaneously be solving its
associated dual problem as well.
Conversion of Primal into Dual Problem
Primal Problem Dual Problem
Max Z=6x1+7x2 Min Z*= 12y1+8y2

Subject to Subject to

2x1+3x2≤12 2y1+2y2≥6
2x1+x2≤8 3y1+y2 ≥7
X1≥0, X2 ≥0 y1, y2 ≥0
Primal to Dual Problem of an LPP
Primal Dual
Min Z=3x1+2.5x2 Max Z*=40y1+50y2
Sub to Sub to
2x1+4x2 ≥40 2y1+3y2≤3
3x1+2x2 ≥50 4y1+2y2 ≤2.5
 x1, x2 ≥0 y1,y2 ≥0
Thank You
Happy Reading!