Karmarkars

Algorithm
SAHIL LODHA
CHIRAG SANCHETI
PRAJEETH PRABHU
SHRIVANI PANDIYA

OBJECTIVE
Different Methods
Differences and advantages of
Karmarkars method.
Idea behind Karmarkars
method.
Applications.
Objective Questions.

INTRODUCTION
Ways to solve linear programming
problems:
1. Graphical approach
2. Simplex algorithm
3. Khatchians ellipsoid method
4. Karmarkars algorithm

COMPARATIVE STUDY
BETWEEN SIMPLEX AND
KARMARKARS METHOD
Simplex Algorithm

Karmarkars Algorithm
Optimal solution point

Feasible Region

ADVANTAGES
Both Khatchians ellipsoid method and
Karmarkars Projective scaling method have been
shown to have polynomial time algorithms.
Time required to solve an LP problem of size n is
at most
anb
where a and b are two positive numbers.
Simplex method has an exponential time algorithm
while solving problems.
Time required to solve an LP problem of size n is
at most

c2n
where c is a positive integer.

KARMARKARS
PROJECTIVE SCALING
METHOD
It follows projective scaling
techniques. (difference between
affine tranformations and projective
transformations).
Starts with a trial solution and
shoots towards the optimal solution.
Logic behind the method.
LPP problems need to be converted
into a standard form.

KARMARKARS
PROJECTIVE SCALING
METHOD
LP problems should be expressed in the following form:
Z CT X
AX 0
1X 1
with : X 0

Minimize
subject to :

Where
x1

x2

c1
c
2

x n

1 1 1 1 1n

cn

c11
c
A 21

c m1

c12
c 22

cm 2

c1n
c 2 n

c mn

n2

KARMARKARS PROJECTIVE
SCALING METHOD
1 n

1 n

X0
It is also assumed that

is a feasible solution and

Z min 0

1 n

1
r

Two other variables are defined as:

n n 1

n 1
and
3n

Karmarkars projective scaling method follows iterative steps to

find the optimal solution

KARMARKARS PROJECTIVE
SCALING METHOD
In general, kth iteration involves following computations
a)

ComputeC I P T PP T 1 P C T
p
where

X k 1

AD k

C C Dk
T

X k 2

X k n

Dk

0
If ,
,C p any
feasible solution becomes an optimal solution.
Further iteration is not required. Otherwise, go to next step.

KARMARKARS
PROJECTIVE SCALING
METHOD
b) Ynew X 0 r
c) X k 1

Cp
Cp

D k Ynew
1D k Ynew

Dk Ynew
However, it can be shown that for k =0, Ynew
1Dk Ynew

d)

Thus,X1 Ynew

Z C T X k 1

e)Repeat the steps (a) through (d) by changing k as k+1

QUESTIONS
What kind of transformation was
originally used by N. Karmarkar?
1. Affine
2. Projective
3. Dilation
4. Rotation

QUESTIONS
What is the time complexity algorithm
followed in the simplex method and the
Karmarkar method respectively?
1. Linear, polynomial
2. Polynomial, linear
3. Polynomial, exponential
4. Exponential, polynomial

QUESTIONS
In Karmarkars method, one:
1. Moves along the feasible boundary points
till the optimal solution is obtained.
2. Moves along the feasible corner points till
the optimal solution is obtained.
3. Moves from inside the feasible region to
the boundary in the direction of
optimality.
4. Moves from origin to the boundary of the
feasible region in the direction of
optimality.

QUESTIONS
Karmarkars method can be used to
solve any Linear Programming
Problem. True or False?

Thank you