OR

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 5

MADAN PALLE INSTITUTE OF TECHNOLOGY &SCIENCE

(UGC-AUTONOMOUS INSTITUTION)
Affiliated to JNTUA, Ananthapuram&Approved by AICTE, New Delhi NAAC
Accredited Institution with A+ Grade, NIRF India Rankings 2022-Band:251 -300 in the
Engineering Discipline, NBA Accredited -B. tech (CIVIL, CSE, ECE, EEE, MECH),
MBA, MCA.

DEPARTMENT OF MANAGEMENT STUDIES


ROLL NUMBER : 23691E0043
NAME OF THE STUDENT : S.Faiza Farhan
YEAR & SEMESTER : 2-1
NAME OF THE COURSE : Master of Business Administration
ASSIGNMENT NO :1
TITLE OF THE TOPIC : simplex method and VAM method problems
ACADEMIC YEAR : 2023-2025
DATE OF SUBMISSION : 23-11-2024
NO. OF SHEETS/ PAGES : 04
NAME OF THE FACULTY : DR.MURGAN
1. SIMPLEX METHOD
MAX Z = 5 x1 + 3 x2
Subject to x1 + x2 < 2
5 x1 + 2 x2 < 10
3 x1 + 8 x2 < 12
X1, x2 > 0
CONDITIONS:
 RHS should be positive.
 Optimal solution should be positive.
 Until solution gets optimal replace x variable for slack variable.
Convert LLP from into standard form:
Max z = 5 x1 + 3 x2 + 0 s1 + 0 s2 + 0 s3
= x1 + x2 + s1 + 0 s2 + 0 s3 = 2
= 5 x1 + 2 x2 + 0 s1 + 1. S2 + 0 s3 = 10
= 3 x1 + 8 x2 + 0 s1 + 0 s2 + 1. S3 = 12
Let assume x1 , x2 = 0
S1 = 2
S2 = 10
S3 = 12
CJ 5 3 0 0 0
CB YB XB X1 X2 S1 S2 S3 C
0 S1 2 1 1 1 0 0 2/1 = 2
0 S2 10 5 2 0 1 0 10/5 = 2
0 S3 12 3 8 0 0 1 12/3 = 4
ZJ-CJ 0 -5 -3 0 0 0

NEW KEY/ PIVOT EQUATION (X1) EQUATION:


OLD S1 EQN / KEY ELEMENTS
2/1 1/1 1/1 1/1 0/1 0/1
2 1 1 1 0 0
NEW S2 EQUATIONS:
OLD S2 EQUATION --- (NPE X E. COEFF)
10 5 2 0 1 0
(2 1 1 1 0 0 X 5)
(-) 10 5 5 5 0 0
------------------------------------
0 0 -3 -5 1 0
NEW S3 EQUATION:
OLD S3 EQUATION --- (NPE X E. COEFF)
12 3 8 0 0 1
(2 1 1 1 0 0 X 3)
6 3 3 3 0 0
-------------------------------------
6 0 5 -3 0 1
NEW ZJ-CJ EQUATION:
OLD ZJ-CJ EQUATION --- (NPE X E. COEFF)
0 -5 -3 0 0 0
(2 1 1 1 0 0 X 5)
10 5 5 5 0 0
----------------------------------
10 0 2 5 0 0
CJ 5 3 0 0 0
CB YB XB X1 X2 S1 S2 S3
5 X1 2 1 1 1 0 0
0 S2 0 0 -3 -5 1 0
0 S3 6 0 5 -3 0 1
ZJ – CJ 10 0 2 5 0 0

MAX Z = 10
X1 = 2
X2 = 0
MAX Z = 5 X1 + 3 X2
=5X2+3X0
= 10
2.
1 2 3 4 SUPPLY
A 15 30 50 10 7
B 70 30 40 60 9
C 40 8 70 20 18
DEMAND 5 8 7 14 34

VAM:
1) 1 2 3 4
15 30 50 10 7
9
70 30 40 60
18
40 8 70 20
5 8 7

2) 2 3 4
30 50 10 2
30 40 60 9
18
8 70 20
8 7 14

3) 3 4
50 10 2
40 60
9
70 20
10
7 14

4) 3 4
50 10 2
40 60
9
7 4

5) 3 4
40 60
9
7 2
15 30 50 10
(5) (2)
6) 70 30 40 60
(7) (2)
40 8 70 20
(8) (8) (10)

TOTAL COST:
= (15*5) + (10*2) +(60*2) +(40*70) +(8*8) +(20*10)
= 75+20+120+280+64+200
= 759

You might also like