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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Econometrica Ročník 34; číslo 2; s. 460 - 471
Hlavní autor: Jagannathan, R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Menasha, Wis The Econometric Society 01.04.1966
George Banta Pub. Co. for the Econometric Society
Témata:
Algorithms
Economic research
Linear programming
Mathematical vectors
Matrices
Optimal solutions
Polyhedrons
Quadratic programming
Tableaux
Zero vectors
ISSN:0012-9682, 1468-0262
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0012-9682
1468-0262
DOI:10.2307/1909944