1.

The technique for selecting a new point depends upon _____________

a) Scope of the problem
b) Nature of the problem
c) Range of the problem
d) Analysis of the problem

2. One of the most powerful techniques for solving non linear programming is to transform
the _________
a) Data
b) Problems
c) Materials
d) Variables

3. One of the techniques developed for solution of non linear programming is?
a) Single programming
b) Multilinear propramming
c) Reverse programming
d) Dynamic programming

4. The first non linear programming procedure to be used in which year?

a) 1950
b) 1940
c) 1960
d) 1970

5.Maximization of f(x) is equivalent to minimization of

a. –f(x)
b. 1/ (f(x))
c. √ (f(x))
d. none of the above

6.A “≤ type” constraint expressed in the standard form is active at a design point if it has
a. zero value
b. more than zero value
c. less than zero value
d. a & c

7.evolutionary algorithms that use techniques inspired by evolutionary biology such as

a. inheritance,
b. mutation, 
c. selection, 
d. all of above
8.When the optimizaion problem cost functions are differentiable, the problem is referred to as
a. rough
b. nonsmooth
c. smooth
d. a & b

9.For a rectangle matrix, when number of rows is less than number of coulmns, i.e., m <n , the rank of
this matrix can be
a. less than or equal m
b. less than or equal n
c. more than or equal m
d. none of the above

10.The feasible region for the inequlailty constraints with respect to equality constraints
a. increases
b. decreases
c. does not change
d. none of the above