This action might not be possible to undo. Are you sure you want to continue?

# NR

Code No: 52106/MT

M.Tech. – I Semester Supplementary Examinations,

September, 2008

OPERATIONS RESEARCH

(Common to Power Electronics/ Electrical Power Engineering)

Time: 3hours Max. Marks:60

Answer any FIVE questions

All questions carry equal marks

- - -

1. Solve the following linear programming problem, by Big ‘M’ method.

Max Z = - 2x

1

– x

2

Subject to : 3x

1

+ x

2

= 3

4x

1

+ 3x

2

≥ 6

x

1

+ 2x

2

≤ 4

x

1

, x

2

≥ 0

2. a) Obtain the dual of the following problem:

Min Z = x

1

+ x

2

+ x

3

Subject to the constraints : x

1

– 3x

2

+ 4x

3

= 5

x

1

– 2x

2

≤ 3

2x

2

– x

3

≥ 4

x

1

, x

2

≥ 0 and x

3

unrestricted.

b) Solve the geometric programming problem:

Min

3 1 2

1 2 1 2 1 2

32

2 4

3

x

Z x x x x x x

− − −

= + +

Subject to 10

1 2

1 2

1 x x

−

=

3. A company has 4 wave houses and 6 stores, the cost of shipping one

unit from ware house i to store j is C

ij

.

If C C

7 10 7 4 7 8

5 1 5 5 3 3

[ ]

4 3 7 9 1 9

4 6 9 0 0 8

ij

= =

and the requirements of the six stores are 4, 4, 6, 2, 4, 2 and

quantities at the ware house are 5, 6, 2, 9. Find the minimum cost

solution.

Contd…2

Code No: 52106/MT :2:

4. a) Solve the following assignment problem:

Men

I II III IV V

Tasks

1 3 2 8 8

2 4 3 1 5

5 6 3 4 6

3 1 4 2 2

1 5 6 5 4

A

B

D

E

C

b) Use the graphical method to minimize the time needed to process

the following jobs on the machines shown below, i.e for each

machine find the job which should be done first. Also calculate the

total time needed to complete both the jobs:

Job

1

Sequence of Machines:

Time :

A

2

B

3

C

4

D

6

E

2

Job

2

Sequence of Machines:

Time :

C

4

A

5

D

3

E

2

B

6

5. a) Solve the following (2×4) game:

B

I II III IV

A

2 2 3 1

4 3 2 6

I

II

−

b) Explain how simulation can be applied in case of electrical

systems.

6. A man is engaged in buying and selling identical items. He operates

from a ware house that can hold 500 items. Each month he can sell

any quantity that he chooses up to the stock at the beginning of the

month. Each month, he can buy as much as he wishes for delivery at

the end of the month so long as his stock does not exceed 500 items.

For the next four months, he has the following error – free forecasts of

cost sales prices:

Month ( i ) 1 2 3 4

Cost (C

i

) 27 24 26 28

SalePrice (P

i

) 28 25 25 27

Contd…3

Code No: 52106/MT :3:

If he currently has a stock of 200 units, what quantities should he sell

and buy in next four months? Find the solution using dynamic

programming.

7. Find the minimum of

5 3

5 20 f λ λ λ 5 = − − + .

8. Minimize

2

1 2 1 2 1 1 2 2

( , ) 2 2

2

f x x x x x x x x = − + + +

1 2

0.8 x x ∆ = ∆ =

. starting from the point

. The and c = 0.1.

1

0

0

X

¦ ¹

=

´ `

¹ )