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.

Bibliographic Details
Published in:	Econometrica Vol. 33; no. 4; pp. 841 - 847
Main Author:	Jagannathan, R.
Format:	Article
Published:	Wiley-Blackwell Oct65
Subjects:	Nonlinear programming Convex functions
Online Access:	View this record in EBSCOhost

Internet

View this record in EBSCOhost