Pnls

Non-linear separable programming
Multiple choices with only one answer:
1. Which of the following methods is included in the unconstrained sequential algorithms?
A. Penalty functionmethods
B. Gradient search procedures.
C. Linear approximation method.
D. Quadratic approximation method
E. Simplex method
Reason: Unconstrained sequential algorithms includemethods penalty function and barrier function methods.
2. Separable nonlinear programming is a special case of:
F. Quadratic nonlinear programming.
G. Fractional nonlinearprogramming.
H. Convex nonlinear programming.
I. Pure integer programming.
J. Binary integer programming.
Reason: separable nonlinear programming is a special case of convex nonlinearprogramming.
3. separable nonlinear programming can be applied in problems about:
K. Production/man-hours.
L. Cash flow.
M. Security.
N. Training in service companies.O. traffic assignment
Reason: separable non-linear programming can be applied to traffic assignment problems

4. The feature that should have the variables in separable nonlinearprogramming is:
P. Bounded below a known constant value.
Q. In PNLS there are no constraints for the variables
R. Can take any value above zero
S. Bounded above zero and below aknown value.
T. Can take any value below zero.

Reason: In PNLS problems, the constraints must be constrained and positive.

5. Sequential approximation algorithms replace the nonlinearobjective function by:
U. A succession of approximations linear or quadratic
V. A succession of fractional approximations.
W. A new function with one more variable
X. A listwith integer values.
Y. A succession of integer values and fractional approximations.
Reason: Sequential approximation algorithms replace the nonlinear objective function by a succession of...