A survey on the continuous nonlinear resource allocation problem
M Patriksson - European Journal of Operational Research, 2008 - Elsevier
Our problem of interest consists of minimizing a separable, convex and differentiable
function over a convex set, defined by bounds on the variables and an explicit constraint …
function over a convex set, defined by bounds on the variables and an explicit constraint …
[PDF][PDF] A survey on a classic core problem in operations research
M Patriksson - Report, Department of Mathematics, Chalmers …, 2005 - math.chalmers.se
Our problem of interest consists of minimizing a separable, convex and differentiable
function over a convex set, defined by bounds on the variables and an explicit constraint …
function over a convex set, defined by bounds on the variables and an explicit constraint …
A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
JB Etoa Etoa - Journal of Information and Optimization Sciences, 2010 - Taylor & Francis
This paper presents a sequential linear programming algorithm for computing a stationary
point of a mathematical program with linear equilibrium constraints. The algorithm is based …
point of a mathematical program with linear equilibrium constraints. The algorithm is based …