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!

Be the first to leave a comment!