Water Resource Planning and Management Mid - I, September - 2014

1.In Linear programming
  • Objective function is linea
  • Constraints are linear
  • Objective function and constraints are linear
  • None
Answer: C
2.Which of the following optimization Technique can be used as a multi-stage decision making problem
  • Linear Optimization
  • Non-linear Optimization
  • Integer Programming
  • Dynamic Programming
Answer: D
3.A function is said to be strictly convex:
  • If a straight line connecting any two points on the function lies completely above the function
  • If a straight line connecting any two points on the function lies completely below the function
  • If a straight line connecting any two points on the function lies at the same level
  • None
Answer: A
4.Graphical method of linear programming can be applied when the decision variables are:
  • Single variable
  • Two variables
  • Multivariable
  • None
Answer: B
5.The standard form for the inequality constraint: 4x1 + 8x2 < 10
  • 4x1 + 8x2 < 10
  • 4x1 + 8x2 = 10
  • 4x1 + 8x2 + S1 = 10
  • 4x1 + 8x2 - S1 = 10
Answer: C
6.A reservoir water allocation problem can be solved by using:
  • Linear Programming
  • Dynamic Programming
  • Integer Programming
  • Multi objective Programming
Answer: B
7.For the given objective function f(x) = x13 + x23 - 3x1 + 20, stationary point is X = (1, 2), maximum objective function, fmin(X) is:
  • 4
  • 2
  • 6
  • 8
Answer: B
8.If the objective function is of minimization type, in Simplex method the objective function is multiplied with following to convert into maximization type:
  • 1
  • -1
  • 0
  • None
Answer: B
9.Consider the constraint 8X1 + 9X2 ≥ 10, then suggest _____variable is need to be subtracted
  • Equality
  • Slack
  • Inequality
  • Surplus
Answer: D
10.An optimization problem involving multiple objective functions is known as
  • Dynamic programming
  • Linear programming
  • Degeneracy programming
  • Multi-objective programming
Answer: D
11.Dynamic Programming is based on __________________Principle.
Answer: Bellman’s
12.Lagrange multiplier can be written as______________________
Answer: Lf(X) = f(X) - λg(X)
13._________________studies an optimization model when objective function or the constraints or both are nonlinear.
Answer: Non-linear Programming
14.The necessary and sufficient conditions for the optimal solution of problems in non-linear programming is defined by ______________ conditions.
Answer: Kuhn tucker conditions
15.A basic feasible solution is said to be _____________ basic feasible solution, if it also optimizes the objective function.
Answer: Optimum
16.Consider the constraint X1 + X2 ≤ 2, then suggest ______________ variable is need to be subtracted.
Answer: Slack
17.If all the coefficients in Z-row are non-negative in Simplex method, the solution is reached to ______________________
Answer: Optimal Solution
18.A primary requirement of linear programming problem is that the objective function and every constraint function must be _______________
Answer: Linear
19.Shortest path of a road network optimization problem can be solved using__________________
Answer: Dynamic Programming
20.CPM acronym is ___________________
Answer: Critical Path Method