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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Econometrica Jg. 34; H. 2; S. 460 - 471
1. Verfasser: Jagannathan, R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Menasha, Wis The Econometric Society 01.04.1966
George Banta Pub. Co. for the Econometric Society
Schlagworte:
Algorithms
Economic research
Linear programming
Mathematical vectors
Matrices
Optimal solutions
Polyhedrons
Quadratic programming
Tableaux
Zero vectors
ISSN:0012-9682, 1468-0262
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0012-9682
1468-0262
DOI:10.2307/1909944