Imagen de Portada
Código QR

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.

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
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=4998563&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 4998563
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00129682
        ECN
      jtl: Econometrica
      issn: 00129682
      maglogo: Y
    pubinfo:
      dt: Oct65
      vid: 33
      iid: 4
      pid: 480
      pub: Wiley-Blackwell
    artinfo:
      ui:
        4998563
        10.2307/1910360
      ppf: 841
      ppct: 6
      formats:
      tig:
        atl: A METHOD FOR SOLVING A NONLINEAR PROGRAMMING PROBLEM IN SAMPLE SURVEYS.
      aug:
        au: Jagannathan, R.
      su:
        Nonlinear programming
        Convex functions
      sug:
        subj:
          Nonlinear programming
          Convex functions
      ab: 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.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 1965
    holdings:
      @attributes:
        islocal: N