Match List I with List II and choose the correct answer from the code given below:
| List I | List II | ||
| (a) | Hawkins-Simon Conditions | (i) | Theory of Games |
| (b) | Saddle Point | (ii) | Non-Linear Programming |
| (c) | Simplex Method | (iii) | Input-Output Analysis |
| (d) | Kuhn-Tucker Conditions | (iv) | Linear Programming |
1
(a) - (i), (b) - (ii), (c) - (iv), (d) - (iii)
2
(a) - (ii), (b) - (i), (c) - (iii), (d) - (iv)
3
(a) - (iii), (b) - (ii), (c) - (i), (d) - (iv)
4
(a) - (iii), (b) - (i), (c) - (iv), (d) - (ii)