Similar Search Results

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

Benson, Harold P.; Sun, Erjiang - In: European Journal of Operational Research 199 (2009) 1, pp. 1-8

This article presents a branch-and-reduce algorithm for globally solving for the first time a convex minimization problem (P) with p[greater-or-equal, slanted]1 additional multiplicative constraints. In each of these p additional constraints, the product of two convex functions is constrained to...

Persistent link: https://www.econbiz.de/10004973515

An algorithm for optimizing over the weakly-efficient set

Benson, Harold P. - In: European Journal of Operational Research 25 (1986) 2, pp. 192-199

Persistent link: https://www.econbiz.de/10005337497

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem

Benson, Harold P. - In: European Journal of Operational Research 182 (2007) 2, pp. 597-611

Persistent link: https://www.econbiz.de/10005337896

Fractional programming with convex quadratic forms and functions

Benson, Harold P. - In: European Journal of Operational Research 173 (2006) 2, pp. 351-369

Persistent link: https://www.econbiz.de/10005158552

Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages.

Benson, Harold P. - In: European Journal of Operational Research 176 (2007) 3, pp. 1961-1964

Persistent link: https://www.econbiz.de/10005287822

Dynamic lot-sizing with setup cost reduction

Denizel, Meltem; Erenguc, Selcuk; Benson, Harold P. - In: European Journal of Operational Research 100 (1997) 3, pp. 537-549

Persistent link: https://www.econbiz.de/10005240301

A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

Benson, Harold P.; Sun, Erjiang - In: European Journal of Operational Research 139 (2002) 1, pp. 26-41

Persistent link: https://www.econbiz.de/10005329927