Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Ldrp-Itr Question Bank of OT

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

LDRP-ITR

Question Bank of OT
Part
1 Definition : -Linearly independent, Inner Product, Cauchy Schwarz Inequality, 1-4
Orthogonal projection, Line segment, Sub space, eigen values and vector,
Orthoginal matrix, jacobian matrix, local and global minimizer or maximize,
constraint and unconstraint optimization problems, FONC, SONC, SOSC, Golden
Section ratio,
2 Short Notes: - Hyper planes, Convex Sets, Neighborhoods, Polytopes, Level Sets, 1
Linear Transformation, orthogonal projection, Feasible Direction
3 Find of Rank of a given Matrix. 1
4 Explain and find out norms of a vector and matrix. 1
5 Find out Eigen values and Eigenvectors of a given matrix. 1
6 Find out Definiteness of a given matrix or quadratic equation. 1
7 Find out Gradient and Hessian of a given Function. 1
8 Find out Derivative using Chain Rule. 1
9 Find out Taylor Series Expansion for given function. 1
10 Formulate LPP models from given problem statement. 3
11 Convert given LPP problem into standard form. 3
12 Solve given LPP problem using Simplex, 2 phase or Revised Simplex Method. 3
13 Find out Dual of Given Primal LPP problem. 3
14 Explain and Compare Simplex and Karmarkar Method. 3
15 Write down steps to solve LPP problem using Simplex, 2 Phase or Revised Simplex 3
Method.
16 Check FONC, SONC and SOSC condition on function. 2
17 Minimize function using golden section method 2
18 Minimize function using fibonacci search method 2
19 Minimize function using secant method 2
20 Minimize function using newton raphson method 2
21 Minimize function using steepest descent ( gradient ) method. 2
22 Minimize function using conjugate gradient method 2
23 Minimize function using conjugate direction method 2
24 Minimize function using Rank one, DFP or BFGS method. 2
25 Write down step to solve function using Rank one, DFP or BFGS method 2
26 Write down step to solve function using conjugate gradient method or conjugate 2
direction method or steepest descent ( gradient ) method
27
28
29
30

You might also like