wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

KMK31503 Quiz 3: Classical Optimization Method

Total questions: 10

Worksheet time: 3mins

Name
Class
Date
1.

Which of the following optimization methods is a classical optimization method?

a)

Newton's method

b)

Random search

c)

Linear Programming

d)

Nonlinear programming

2.

Which of the following is NOT the basic concept of the classical optimization method?

a)

Continuity of functions

b)

Linear programming problem statement

c)

Non-linear program problem statement

d)

Convexity and its application

3.

Which of the following best describe the concept of the continuity of function?

a)

A function is known as continuous when all of the points are connected

b)

A function is known as discontinuous when all of the points are connected

c)

A function can be both continuous and discontinuous.

d)

A function can never be continuous and discontinuous in its derivatives.

4.

Which of the following can be the non-linear program statement?

a)

f=(x13)2+(x2+10)2f=\left(x_1-3\right)^2+\left(x_2+10\right)^2

b)

f=ax3+9x96f=ax^3+9x-96

c)

f=1x16x12+8x2f=\frac{1}{x_1}-6x_{1_{ }}^2+8x_{2_{ }}

d)

f=8x27x+9f=\frac{8}{x^2}-\frac{7}{x}+9

5.

Which of the following classification is incorrect in the classification of the convexity?

a)

 xTHx>0 for all x0x^THx>0\ for\ all\ x\ne0  

b)

 xTHx<0 for all x0x^THx<0\ for\ all\ x\ne0  

c)

 xTHx0 for all x0x^THx\ge0\ for\ all\ x\ne0  

d)

 xTHx<0 for some x and >0for other xx^THx<0\ for\ some\ x\ and\ >0for\ other\ x  

6.

Which of the following is not an iterative method?

a)

Newton's method

b)

Quasi-Newton's method

c)

Analytical method

d)

Finite different approximations to derivatives

7.

Which of the following is not the procedures for Newton's method?

a)

Write down the f(x), f'(x) and f"(x)

b)

Apply the equation: xk+1=xk+f(xk)f"(xk)x^{k+1}=x^k+\frac{f'\left(x^k\right)}{f"\left(x^k\right)}


c)

Check the values of f(xk) f\left(x^k\right)\ and f(xk+1)f\left(x^{k+1}\right)

d)

Continue iteration until two x values are similar

8.

Which of the following is not the disadvantages of Newton's method?

a)

The need to calculate both f'(x) and f"(x)

b)

The method converges slowly if f"(x) is near zero

c)

The method can converge if the initial point is not close to the minimum

9.

Which of the following is the advantage of the finite difference approximations to derivatives?

a)

The error introduced might be big due to finite differencing

b)

The error introduced might be small due to finite differencing

c)

The need to differentiate the function is not needed

d)

The need to continue iteration is not needed

10.

Which of the following is not the procedures of the Quasi-Newton method?

a)

Identify xpx^p and xqx^q

b)

Find the gradient between these two points

c)

Calculate the new xpx^p or xqx^q

d)

Write down the f(x), f'(x) and f"(x)