Publication | Closed Access
The Simplex Method for Quadratic Programming
510
Citations
5
References
1960
Year
Mathematical ProgrammingConic OptimizationComputational ProcedureEngineeringNonlinear ProgrammingQuadratic FunctionSystems EngineeringConstrained OptimizationSemi-definite OptimizationSimplex MethodInverse ProblemsComputer ScienceLinear ProgrammingApproximation TheoryQuadratic ProgrammingOperations Research
A computational procedure is given for finding the minimum of a quadratic function of variables subject to linear inequality constraints.The procedure is analogous to the Simplex Method for linear programming, being based on the Barankin-Dorfman procedure for this problem.
| Year | Citations | |
|---|---|---|
Page 1
Page 1