Scribd
Upload
15 views5 pages

Linear Programming Optimization Steps

This document details the steps of solving two linear programming problems using the simplex method. For the first problem, the optimal solution is to produce 200 units of product A and 600 units of product B to maximize profits of Rs 2600. For the second problem, the optimal solution is to produce 15 units of product X1, 45 units of product X2, and 0 units of product XB to maximize profits of Rs 4335. The problem is converted to standard form and the simplex method is applied in multiple steps to arrive at the optimal solution.

Uploaded by

ankushkalia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views5 pages

Linear Programming Optimization Steps

This document details the steps of solving two linear programming problems using the simplex method. For the first problem, the optimal solution is to produce 200 units of product A and 600 units of product B to maximize profits of Rs 2600. For the second problem, the optimal solution is to produce 15 units of product X1, 45 units of product X2, and 0 units of product XB to maximize profits of Rs 4335. The problem is converted to standard form and the simplex method is applied in multiple steps to arrive at the optimal solution.

Uploaded by

ankushkalia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Task1

Subjected to the constraints

and,

STEP 1:

BV

CB

XB

X1

X2

S1

S2

S3

S4

S1

1000

Min
value
500

S2

800

800

S3

400

400

S4

700

1=-4

2=-3

3=0

4=0

5=0

6=0

Z =0

STEP 2:
In the second step we enter a new variable X1 and enter the Cb ( coefficient) of the variable i.e 4
and calculate the row value by diving the variables by the pivot point.
VARIABLES
XB

ROW 3

ROW 1

ROW 2

ROW4

400/1=400

1000-2*400=200

800-1*400=400

700-0*400=700

X1
X2
S1
S2
S3
S4

1/1=1
0/1=0
0/1=0
0/1=0
1/1=1
0/1=0

2-2*1=0
1-2*0=1
1-2*0=1
0-2*0=0
0-2*1=-2
0-2*0=0

1-1*1=0
1-1*0=1
0-1*0=0
1-1*0=1
0-1*1=-1
0-1*0=0

0-0*1=0
1-0*0=1
0-0*0=0
0-0*0=0
0-0*1=0
1-0*0=1

BV

CB

XB

X1

X2

S1

S2

S3

S4

S1

200

-2

Min
value
200

S2

400

-1

400

X1

400

S4

700

700

1=0

2=-3

3=0

4=0

5=-4

6=0

Z =1600

BV

CB

XB

X1

X2

S1

S2

S3

S4

X2

200

-2

Min
value
-100

S2

200

-1

200

X1

400

400

S4

500

-1

250

1=0

2=0

3=3

4=0

5=-2

6=0

Z =2200

BV

CB

XB

X1

X2

S1

S2

S3

S4

X2

600

Min
value

S3

200

-1

X1

200

-1

S4

100

-2

1=0

2=0

3=1

4=2

5=0

6=0

Z =2600

After the calculation the value of z is 2600 and we got the value of all s positive so we got our
solution. The optimal solution of this problem is company is manufacturing X1=200 belts of
type A ans X2=600 belts of type B. in order to obtain the the maximum profit Rs 2600.

Task2

model into its standard form. So equations are after adding the slack variable :

subjected to

And

BV

CB

XB

X1

X2

S1

S2

S3

S1

240

1.6

Min
value
150

S2

162

0.5

81

S3

50

50

1=-15

2=-45

3=0

4=0

5=0

Z =0

BV

CB

XB

X1

X2

S1

S2

S3

S1

160

-8/5

Min
value
160

S2

62

1/2

-2

124

X2

45

50

1=-15

2=0

3=0

4=0

5=45

Z =2250

BV

CB

XB

X1

X2

S1

S2

S3

S1

36

-2

12/5

Min
value
15

X1

15

124

-4

-31

X2

45

50

50

1=0

2=0

3=0

4=30

5=-15

Z =4110

BV

CB

XB

X1

X2

S1

S2

S3

S3

15

5/12

5/6

X1

15

184

-5/3

-4/3

X2

45

35

-1

-5/12

-5/6

1=0

2=0

Z =4335

3=25/4 4=35/2

5=0

Min
value

You might also like