The Simplex Method for Quadratic Programming: Notes on Linear Programming and Extensions-Part 51

The Simplex Method for Quadratic Programming: Notes on Linear Programming and Extensions-Part 51

$23.00
{{option.name}}: {{selected_options[option.position]}}
{{value_obj.value}}

A computational procedure for finding the minimum of a quadratic function of variables subject to linear inequality constraints.

Show More Show Less