A detailed description of 188 problems for testing nonlinear programming algorithms is presented. The considered types of objective functions are: linear (33 problems), quadratic (44), sum of squares (36), generalized polynomial (57), general (23). Among them 46 problems are unconstrained, 24 problems are with linear constraint functions, 54 with quadratic, 18 with generalized polynomials and 12 with general constraint functions. For 9 problems upper and lower bounds are presented.