The Symmetric Formulation of the Simplex Method for Quadratic Programming

DOI10.2307/1912797zbMath0183.49004OpenAlexW2023859620MaRDI QIDQ5575232

Andrew B. Whinston, Cornelis van de Panne

Publication date: 1969

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1912797

zbMATH Keywords

operations research

Related Items

A unified approach to one-parametric general quadratic programming, Some generalizations of the criss-cross method for quadratic programming, On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft, An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis, The general quadratic optimization problem, Equivalence of some quadratic programming algorithms, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, An equivalence between two algorithms for quadratic programming, Least-index resolution of degeneracy in quadratic programming, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, A strictly improving linear programming Phase I algorithm