Optimization Techniques Mid - II, November - 2014

1.The Fibonacci method can be used to find the _______ of a function
  • maximum
  • minimum
  • a and b
  • zero of a function
Answer: B
2.If dual has an unbounded solution, primal has
  • No feasible solution
  • unbounded solution
  • feasible solution
  • none
Answer: A
3.In an optimal solution of AP of 4*4 matrix the minimum number of lines we must get at least is
  • 3
  • 15
  • 4
  • 7
Answer: C
4.The direct search methods are also known as __________ order methods
  • 0th
  • 1st
  • 2nd
  • nth
Answer: A
5.An LPP solved by using DPP method assumes the variables as
  • states
  • stages
  • recursions
  • return functions
Answer: B
6.The quadratic interpolation method uses the ________ values only.
  • initial
  • final
  • a and b
  • function
Answer: D
7.A conjugate directions method will minimize a quadratic function in a _______ Number of steps.
  • Finite
  • Infinite
  • both a and b
  • None
Answer: A
8.The descent methods which requiring both 1st and 2nd derivatives of the function are termed as ________ order methods.
  • Zeroth
  • First
  • Second
  • nth
Answer: C
9.In dynamic programming, which of the following does not change at every stage
  • Objective function
  • recursive function
  • results
  • state variables
Answer: B
10.The unconstrained minimization problem can be solved by using ______ calculation method.
  • Differential
  • Partial Differential
  • both a and b
  • none
Answer: A
11._________________ method is an extension of the basic pattern search method.
Answer: Powell’s
12.The algebraic equation that represents the benefits of a decision in DPP is called _______________
Answer: Return function
13.A unimodal function is that has only _________________ or _________________
Answer: Maximum (one peak), minimum (one valley)
14.Penalty parameter contains the term _________________, _________________ and __________
Answer: Gj, gj, rk
15.The optimal value of the objective function is same for the __________ and_____________ problem
Answer: Primal, dual
16.Unconstrained minimization methods can be classified in____________ and ___________ methods.
Answer: Direct search, descent
17.The final stage decision is first solved in_________________ recursion
Answer: Backward
18.Powell’s and steepest descent method are ___________ optimization techniques.
Answer: Unconstrained
19.The costs of dummy cells are taken as_________________
Answer: Zero
20.The interior penalty function methods are also known as _________________
Answer: Barrier methods