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.

Saved in:
Bibliographic Details
Published in:Econometrica Vol. 34; no. 2; pp. 460 - 471
Main Author: Jagannathan, R.
Format: Journal Article
Language:English
Published: Menasha, Wis The Econometric Society 01.04.1966
George Banta Pub. Co. for the Econometric Society
Subjects:
Algorithms
Economic research
Linear programming
Mathematical vectors
Matrices
Optimal solutions
Polyhedrons
Quadratic programming
Tableaux
Zero vectors
ISSN:0012-9682, 1468-0262
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0012-9682
1468-0262
DOI:10.2307/1909944