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.
MLA
Jagannathan, R.. “A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure.” Econometrica, vol. 34, .no 2, Econometric Society, 1966, pp. 460-471, https://www.jstor.org/stable/1909944
Chicago
Jagannathan, R.. “A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure.” Econometrica, 34, .no 2, (Econometric Society: 1966), 460-471. https://www.jstor.org/stable/1909944
APA
Jagannathan, R. (1966). A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure. Econometrica, 34(2), 460-471. https://www.jstor.org/stable/1909944
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.
