Narrow search
Showing 1 - 7 of 7
Cover Image
An all-linear programming relaxation algorithm for optimizing over the efficient set
Benson, Harold P. - In: Journal of global optimization : an international … 1 (1991) 1, pp. 83-104
Persistent link: https://www.econbiz.de/10001109026
Cover Image
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
Benson, Harold P. - In: Journal of global optimization : an international … 6 (1995) 3, pp. 231-251
Persistent link: https://www.econbiz.de/10001181838
Cover Image
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
Benson, Harold P.; Sun, Erjiang - In: European journal of operational research : EJOR 199 (2009) 1, pp. 1-8
Persistent link: https://www.econbiz.de/10003862843
Cover Image
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda; Benson, Harold P.; Erenguc, Selcuk - In: International journal of production research 54 (2016) 13/14, pp. 3943-3961
Persistent link: https://www.econbiz.de/10011508452
Cover Image
A note on the paper Fractional programming with convex quadratic forms and functions by H. P. Benson
Frenk, Johannes G. (contributor);  … - 2005
Persistent link: https://www.econbiz.de/10002628024
Cover Image
A note on the paper Fractional programming with convex quadratic forms and functions by H. P. Benson
Frenk, Johannes G. (contributor);  … - 2005
Persistent link: https://www.econbiz.de/10002701060
Cover Image
A finite concave minimization algorithm using branch and bound and neighbor generation
Benson, Harold P. - In: Journal of global optimization : an international … 5 (1994) 1, pp. 1-14
Persistent link: https://www.econbiz.de/10001165411