Benson Harold P.

Harold P. Benson

Information about the author Harold P. Benson will soon be added to the site.
Found 15 papers in total
Fractional programming with convex quadratic forms and functions
2006
This article is concerned with two global optimization problems (P1) and (P2). Each of...
A global optimization approach for generating efficient points for multiobjective concave fractional programs
2005
In this article, we present a global optimization approach for generating efficient...
Maximizing the ratio of two convex functions over a convex set
2006
The purpose of this article is to present an algorithm for globally maximizing the...
Concave envelopes of monomial functions over rectangles
2004
The construction of convex and concave envelopes of real-valued functions has been of...
Dynamic lot-sizing with setup cost reduction
1997
One of the fundamental tenets of the Just-in-Time (JIT) manufacturing philosophy is...
A multiple-objective linear programming model for the citrus rootstock selection problem in Florida
1997
Citrus is one of Florida's key agricultural crops, with annual production accounting...
Towards finding global representations of the efficient set in multiple objective mathematical programming
1997
The authors propose and justify the proposition that finding truly global...
Deterministic algorithms for constrained concave minimization: A unified critical survey
1996
The purpose of this article is to present a unified critical survey of the...
A face search heuristic algorithm for optimizing over the efficient set
1993
The problem of optimizing a linear function over the efficient set of a multiple...
Concave minimization via conical partitions and polyhedral outer approximation
1991
An algorithm is proposed for globally minimizing a concave function over a compact...
Complete efficiency and the initialization of algorithms for multiple objective programming
1991
Complete efficiency in multiple objective programming may be more common than has been...
Using efficient feasible directions in interactive multiple objective linear programming
1991
In this paper the authors show how to incorporate efficient feasible directions into...
Separable concave minimization via partial outer approximation and branch and bound
1990
This paper presents a new algorithm for globally minimizing a separable, concave...
An algorithm for concave integer minimization over a polyhedron
1990
The authors present an algorithm for solving the problem of globally minimizing a...
Papers per page: