A METHOD FOR SOLVING A NONLINEAR PROGRAMMING PROBLEM IN SAMPLE SURVEYS.

Presents a method for solving a nonlinear programming problem. Determination on the computational procedure to minimize a separable convex function subject to linear constraints; Description of nonlinear programming; Availability of standards for solving the problems.

Detalles Bibliográficos
Publicado en:	Econometrica Vol. 33; no. 4; pp. 841 - 847
Autor principal:	Jagannathan, R.
Formato:	Artículo
Publicado:	Wiley-Blackwell Oct65
Materias:	Nonlinear programming Convex functions
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	Presents a method for solving a nonlinear programming problem. Determination on the computational procedure to minimize a separable convex function subject to linear constraints; Description of nonlinear programming; Availability of standards for solving the problems.