QUESTION BANK

CBOT

1. What steps are required to solve a linear programming problems.

2. What do you mean by slack and surplus variable discuss also when
introduced an artificial variable.

3. Min z = x2 – 3x3 + 2x5

Sub to
3x2 – x3 + 2x5 < 7
–2x2 + 4x3 < 12
–4x2 + 3x3 + 8x5 < 10
x2, x3, x5 > 0

4. Max z = 4x1 + 5x2 – 3x3 + 50

Sub to
x1 + x2 + x3 = 10
x1 – x2 > 1
2x1 + 3x2 + x3 < 40
x1, x2, x3 > 0
5. Solve the following L.P.P. by Graphical Method.

Max z = –3x1 + 2x2

Sub to x1 < 3
x1 – x 2 < 0 and x1, x2 > 0
6. Min z = 5x1 + 3x2
Sub to
3x1 + 5x2 = 15
5x1 + 2x2 = 10
x1, x2 > 0
6. Max z = 4x1 + 5x2 – 3x3 + 50
Sub to
x1 + x2 + x3 = 10
x1 – x2 > 1
2x1 + 3x2 + x3 < 40
in the problem.

7. solve Max z = 4x1 + 5x2 – 3x3 + 50

Sub to
x1 + x2 + x3 = 10
x1 – x2 > 1
2x1 + 3x2 + x3 < 40

7. the following problems by Revised Simplex Method.

Sub to
x1 + x2 < 3
x1 + 2x2 < 5
3x1 + x2 <

8. Min z = x1 + 2x2
Sub to
x1 + x3 = 4
x2 + x4 = 6
3x1 + 2x2 + x5 = 12
Sub to
x1 + x2 < 3
x1 + 2x2 < 5
3x1 + x2 < 6
x1, x2 > 0
9. Use Dual Simplex Method to solve.
Min z = 3x1 + x2
Sub to
x 1 + x2 > 1
2x1 + 3x2 > 2
x1, x2 > 0

10. What is the transportation problem and also write the metrix from of
the transportation problems.

11. Find the initial basic feasible solution to transportation problem using
metrix minima method.

D1 D2 D3 D4

O1 1 2 3 4 6

O2 4 3 2 0 8

O3 0 2 2 1 10

4 6 8 6

12. Determine an optimal solution using (i) Vegel's Method (ii) Row
Minima to the following transportation probm.

Destination

1 2 3 4 Supply

1 21 16 15 13 11

Source 2 17 18 14 23 13

3 32 27 18 41 19

Demand 6 10 12 15 43
13. State the general form of an integer programming problems.

14. Solve the following L.P.P. by two-phase method

Min z = 3x1 – x2
Sub to
2x1 + x2 > 2
x1 + 3x2 < 2
x2 < 4
x1, x2 > 0
15. Differentiate between initial basic feasiable solution and feasiable
solution in transport problem and also describe the optimally test.

16. Explain the Hungarian method to solve an assignment problem.

17. Solve the following Assignment problem.

Man
1 2 3 4

I 12 30 21 15

II 18 33 9 31
Work
III 44 25 24 21

IV 23 30 28 14

18. Obtain the set of necessary conditions for the non-linear

programming.
Maximize z = x12 + 3x22 + 5x32
Sub to
x1 + x2 + 3x2 = 2
5x1 + 2x2 + x3 = 5
x1, x2, x3 > 0
19. State and prove Kaun-Tucker necessary and sufficient conditions in
non-linear programming.

20. Write the Kaun-Tucker Conditions for the following Minimization

problem:

Min z = x12 + x22 + x32

Sub to
2x1 + x2 < 5
x 1 + x3 < 2
– x1 < –1
– x2 < –2
– x3 < 0
21. What is Quadratic programming? Explain Wolf's Method to solve it.

22. What is meant by quadratic programming problem. How does

quadratic programming problem differ from the linear programming
problem.

23. Write the Kaun-Docker necessary condition for the following

problems.
Max f(x) = x13 – x22 + x1x32
Sub to
x1 + x22 + x3 = 5
5x12 – x22 – x3 > 2
x1, x2, x3 > 0
24. Apply Welf's Method for solving the quadratic programming problem:

Max f(x) = 4x1 + 6x2 – 2x12 – 2x1x2 – 2x22

Sub to
x1 + 2x2 < 2
x1, x2 > 0
25. Find the solution of Dynamic programming problem.

Z = Max (y1, y2, y3)

Sub to
y 1 + y2 + y3 = 5
y1, y2, y3 > 0
26. State the principle of optimality in dynamic programming and give a
mathematical formulation of a dynamic programming problem.

27. Use dynamic programming to shows that:

Z = x1 log x1 + x2 log x2 + ......... + xn log xn

Sub to
x1 + x2 + .............. + xn = k
xi > 0, i = 1, 2, 3, ............, n
28. Describe the fundamental components of a queuing process and
give suitable examples.

29. What is queuing problem? Explain queuing system, transient and

steady state.

30. Show that inter-arrival times are distributed exponentially, if arrivals

is a paisson process.

31. Explain the role of exponential distribution and its characteristics.

32. Explain Kendall's notations for representing queuing models.

33. Shows that if the inter-arrival times are negative exponential

distributed, the number of arrivals in a time-period is a paisson
process and conversely.
34. Show that for a single service station, Paisson arrivals and
exponential service time, the probability that exactly 'n' calling units
are in the queuing system is

l n = (1 − l ) .l n , n≥0

Where l is the traffic intensity.

35. State some important applications of queuing models.

36. What do you mean by queue discipline? Explain four queue

discipline.

37. Explain clearly the various costs that are involved in inventory
problems with suitable examples. How they are inter-related?

38. Describe the basic characteristic of an inventory system.

39. What is meant by inventory problem? Give the classification of

different inventory models.

40. What is Economic Order Quantity? Discuss step by step the

development of EOQ formula.

41. Find the EOQ for the following data

Annual Usage = 1,000 pieces
Cost per piece = Rs. 250
Ordering Cost = Rs. 6 / order
Expediting Cost = Rs. 4 / order
Inventory Holding cost = 20% of average inventory
Material holding cost = Rs. 1 / piece
42. What is replacement problem? Describe some important
replacement situations.

43. Explain briefly "How the replacement problems are classified?"

44. Write a brief note on 'Replacement Policy of items which deteriorate
with time.

45. The following table gives the running cost per year and resale price
of certain equipment whose purchase price is Rs. 5000.

Years: 1 2 3 4 5 6 7 8
Running Cost: 1500 1600 1800 2100 2500 2900 3400 4000
Resale Cost: 3500 2500 1700 1200 800 500 500 500

At what year is the replacement due?

46. Explain how the theory of replacement is used in the problem of

replacement of items that fail completely.