This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
An operations research technique that solves problems in which an optimal value is sought subject to specified constraints. Mathematical programming models include linear programming, quadratic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results