Harold P. Benson

27 papers Journal 24
YearRankTypeTitle / Venue / Authors
2012 J jnl
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem.
J. Glob. Optim.
Harold P. Benson
2012 J jnl
Preface.
J. Glob. Optim.
Nguyen V. Thoai, Harold P. Benson, Panos M. Pardalos
2009 J jnl
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints.
Eur. J. Oper. Res.
Harold P. Benson, Erjiang Sun
2009 — ch.
Concave Programming.
Encyclopedia of Optimization
Harold P. Benson
2009 — ch.
Multi-objective Optimization: Interactive Methods for Preference Value Functions.
Encyclopedia of Optimization
Harold P. Benson
2009 — ch.
Multi-objective Optimization: Pareto Optimal Solutions, Properties.
Encyclopedia of Optimization
Harold P. Benson
2007 J jnl
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem.
Eur. J. Oper. Res.
Harold P. Benson
2007 J jnl
Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages.
Eur. J. Oper. Res.
Harold P. Benson
2006 J jnl
Fractional programming with convex quadratic forms and functions.
Eur. J. Oper. Res.
Harold P. Benson
2004 J jnl
On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals.
Comput. Optim. Appl.
Harold P. Benson
2002 J jnl
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program.
Eur. J. Oper. Res.
Harold P. Benson, Erjiang Sun
2002 J jnl
Using concave envelopes to globally solve the nonlinear sum of ratios problem.
J. Glob. Optim.
Harold P. Benson
2000 J jnl
Pivoting in an Outcome Polyhedron.
J. Glob. Optim.
Harold P. Benson, Erjiang Sun
1999 J jnl
An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming.
J. Glob. Optim.
Harold P. Benson
1998 J jnl
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem.
J. Glob. Optim.
Harold P. Benson
1998 J jnl
Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming.
J. Glob. Optim.
Harold P. Benson, Dongyeup Lee, J. Peter McClure
1997 J jnl
Book Review.
J. Glob. Optim.
Harold P. Benson
1997 J jnl
Dynamic lot-sizing with setup cost reduction.
Eur. J. Oper. Res.
Meltem Denizel, S. Selçuk Erengüç, Harold P. Benson
1995 J jnl
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions.
J. Glob. Optim.
Harold P. Benson
1994 J jnl
A finite concave minimization algorithm using branch and bound and neighbor generation.
J. Glob. Optim.
Harold P. Benson, Serpil Sayin
1994 J jnl
Book review.
J. Glob. Optim.
Harold P. Benson
1993 J jnl
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case.
J. Glob. Optim.
Harold P. Benson
1991 J jnl
An all-linear programming relaxation algorithm for optimizing over the efficient set.
J. Glob. Optim.
Harold P. Benson
1991 J jnl
Complete efficiency and the initialization of algorithms for multiple objective programming.
Oper. Res. Lett.
Harold P. Benson
1991 J jnl
Concave minimization via conical partitions and polyhedral outer approximation.
Math. Program.
Reiner Horst, Nguyen V. Thoai, Harold P. Benson
1991 J jnl
Using efficient feasible directions in interactive multiple objective linear programming.
Oper. Res. Lett.
Harold P. Benson, Yasemin Aksoy
1986 J jnl
Technical Note - On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients.
Oper. Res.
S. Selçuk Erengüç, Harold P. Benson