Andreas Lundell

Learn More
In this paper some transformation techniques, based on power transformations, are discussed. The techniques can be applied to solve optimization problems including signomial functions to global optimality. Signomial terms can always be convexified and underestimated using power transformations on the individual variables in the terms. However, often not all(More)
Main topics of the talk Want to introduce an algorithm for solving nonconvex mixed integer nonlinear problems (MINLPs) to global optimality. Main topics of the talk Want to introduce an algorithm for solving nonconvex mixed integer nonlinear problems (MINLPs) to global optimality. The framework is an extension to that used in the signomial global(More)
Reaction of nitric oxide (NO) with L-proline in methanolic sodium methoxide yields a diazeniumdiolate product, C5H7N3O4Na2.CH3OH (PROLI/NO), that can be stabilized in basic solution but that dissociates to proline (1 mol) and NO (2 mol) with a half-life of only 1.8 s at pH 7.4 and 37 degrees C. This kinetic behavior has allowed the generation of highly(More)
BACKGROUND The hypothesis that thrombin mediates the formation of neointimal vascular lesions at sites of mechanical vascular injury has been tested in baboons by measurement of the effects of hirudin delivered by retrovirus-transduced hirudin-secreting vascular endothelial cells (ECs) lining surgically implanted arterial vascular grafts (AVGs). METHODS(More)
This paper presents an improved as well as a completely new version of a mixed integer linear programming (MILP) formulation for solving the quadratic assignment problem (QAP) to global optimum. Both formulations work especially well on instances where at least one of the matrices is sparse. Modification schemes, to decrease the number of unique elements(More)
A new deterministic algorithm for solving convex mixed-integer nonlinear programming (MINLP) problems is presented in this paper: The extended supporting hyperplane (ESH) algorithm uses supporting hyperplanes to generate a tight overestimated polyhedral set of the feasible set defined by linear and nonlinear constraints. A sequence of linear or quadratic(More)
Global optimization of mixed integer nonlinear programming (MINLP) problems containing signomial terms is in many cases a difficult task, and many different approaches to solve these problems have been devised. In Westerlund (2005) a method where a relaxed convex relaxation of the original problem is obtained by approximating single-variable transformations(More)
  • 1