A SIMPLEX-TYPE ALGORITHM FOR LINEAR AND QUADRATIC PROGRAMMING--A PARAMETRIC PROCEDURE.
A computational procedure based on the results of Barankin and Dorfman, for minimising a convex quadratic function subject to linear constraints is developed. The applicability of the proposed procedure for linear programming problems is indicated.
| Publicado en: | Econometrica Vol. 34; no. 2; pp. 460 - 472 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Wiley-Blackwell
Apr66
|
| Materias: | |
| 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=5009511&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 5009511 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00129682 ECN jtl: Econometrica issn: 00129682 maglogo: Y pubinfo: dt: Apr66 vid: 34 iid: 2 pid: 480 pub: Wiley-Blackwell artinfo: ui: 5009511 10.2307/1909944 ppf: 460 ppct: 12 formats: tig: atl: A SIMPLEX-TYPE ALGORITHM FOR LINEAR AND QUADRATIC PROGRAMMING--A PARAMETRIC PROCEDURE. aug: au: Jagannathan, R. affil: Indian Institute of Management, Ahmedabad su: Convex programming Linear programming Mathematical programming Production scheduling Dynamic programming Vector analysis Economics Econometrics Mathematical economics sug: subj: Convex programming Linear programming Mathematical programming Production scheduling Dynamic programming Vector analysis Economics Econometrics Mathematical economics ab: A computational procedure based on the results of Barankin and Dorfman, for minimising a convex quadratic function subject to linear constraints is developed. The applicability of the proposed procedure for linear programming problems is indicated. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 1966 holdings: @attributes: islocal: N |
|---|