Scribd
Upload
69 views3 pages

Final Examination: Operations Research (OR)

This document contains a final exam for a student named Anuroop Tulasi. The exam contains two questions involving linear programming problems. The first question asks the student to solve an LP problem using the graphic method, providing a figure with the feasible region and optimal solution. The second question asks the student to solve the same LP problem using the simplex method, showing the initial and subsequent simplex tables with iterations until the optimal solution is found.

Uploaded by

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

Final Examination: Operations Research (OR)

This document contains a final exam for a student named Anuroop Tulasi. The exam contains two questions involving linear programming problems. The first question asks the student to solve an LP problem using the graphic method, providing a figure with the feasible region and optimal solution. The second question asks the student to solve the same LP problem using the simplex method, showing the initial and subsequent simplex tables with iterations until the optimal solution is found.

Uploaded by

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

Operations Research (OR)

University of Northern Virginia


Dr. Yingwu Fang
Final examination

Name : Anuroop Tulasi


Student ID : 109 00 4389

1.

Solve the following LPP using the graphic method


Maximize

z = 16x1 + 15x2

Subject to
40x1 + 31x2 <= 124
-x1 + x2 <= 1
x1 <= 3
x1, x2 nonnegative integer

X2
4
3

The optimum occurs at D

2
E

1
A

C
1

4
B

X1

(a) X1 will enter first and the iteration will follow the path ABCD
(b) X2 enters first and the iteration will follow the path AED
(c) The most negative criterion requests most iteration 4vs3 , this criterion is only
a heuristic and although it does not guarantee the smallest number of
iteration , computational experience demonstrates that on the average , the
mosr negative criterion is effected.
(d) Iterations are identical with the exception of the objective row which should
appear with an opposite sign.

2.

Solve the above problem using the simplex method

Table 1
x1

x2

s1

s2

s3

40

31

-1

-16

-15

z
0

s2

s3

z
0

124

Table 2
x1

x2

s1

31

-40

-15

16

48

Table 3
x1

x2

s1

31

1
0

s2

s3

-40

-1

31

71

120

15

-104 31

3
1548

Table 4
x1

x2

s1

s2

s3

71

40

164

-1

31

71

120

71

-31

93

31

104

71

3948

Optimal Solution:
z = 3948/71 = 55.6056
x1 = 93/71 = 1.30986

x2 = 164/71= 2.30986

You might also like