A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure

A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear constraints is developed. The applicability of the proposed procedure for linear programming problems is indicated.

Podrobná bibliografia

Vydané v:	Econometrica Ročník 34; číslo 2; s. 460 - 471
Hlavný autor:	Jagannathan, R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Menasha, Wis The Econometric Society 01.04.1966 George Banta Pub. Co. for the Econometric Society
Predmet:	Algorithms Economic research Linear programming Mathematical vectors Matrices Optimal solutions Polyhedrons Quadratic programming Tableaux Zero vectors
ISSN:	0012-9682, 1468-0262
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!