Harold P. Benson

From MaRDI portal
Person:229676

Available identifiers

zbMath Open benson.harold-pMaRDI QIDQ229676

List of research outcomes

PublicationDate of PublicationType
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem2012-06-13Paper
A global optimization approach for generating efficient points for multiobjective concave fractional programs2011-02-10Paper
Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs2010-10-27Paper
Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint2010-08-13Paper
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints2009-12-07Paper
Global maximization of a generalized concave multiplicative function2008-06-04Paper
Maximizing the ratio of two convex functions over a convex set2008-01-23Paper
Solving sum of ratios fractional programs via concave minimization2008-01-04Paper
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem2007-05-30Paper
Continuous modular design problem: analysis and solution algorithms2007-03-06Paper
Fractional programming with convex quadratic forms and functions2006-06-30Paper
Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints2006-02-08Paper
On the global optimization of sums of linear fractional functions over a convex set2005-01-19Paper
Concave envelopes of monomial functions over rectangles2005-01-11Paper
Using concave envelopes to globally solve the nonlinear sum of ratios problem2004-08-12Paper
Generating sum-of-ratios test problems in global optimization2004-08-06Paper
On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals2004-03-15Paper
Pivoting in an outcome polyhedron2004-01-27Paper
Global optimization of nonlinear sums of ratios2003-03-12Paper
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program2002-06-16Paper
Global optimization algorithm for the nonlinear sum of ratios problem2002-04-11Paper
New closedness results for efficient sets in multiple objective mathematical programming2001-12-05Paper
Outcome space partition of the weight set in multiobjective linear programming2000-09-14Paper
Outcome-space cutting-plane algorithm for linear multiplicative programming2000-09-14Paper
Generalized \(\gamma\)-valid cut procedure for concave minimization2000-06-14Paper
An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming2000-06-05Paper
Dynamic lot-sizing with setup cost reduction1999-08-05Paper
An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem1999-03-18Paper
Hybrid approach for solving multiple-objective linear programs in outcome space1999-02-28Paper
Further analysis of an outcome set-based algorithm for multiple-objective linear programming1999-02-11Paper
Global optimization in practice: An application to interactive multiple objective linear programming1998-09-27Paper
Multiplicative programming problems: Analysis and efficient point search heuristic1998-06-04Paper
Generating the efficient outcome set in multiple objective linear programs: The bicriteria case1998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43676411997-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43468661997-08-05Paper
https://portal.mardi4nfdi.de/entity/Q47159801997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q56869041996-12-11Paper
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem1996-08-06Paper
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions1995-06-19Paper
https://portal.mardi4nfdi.de/entity/Q48338041995-05-23Paper
A finite concave minimization algorithm using branch and bound and neighbor generation1994-08-11Paper
A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set1994-04-27Paper
Optimization over the efficient set: Four special cases1994-04-27Paper
https://portal.mardi4nfdi.de/entity/Q46957841993-06-29Paper
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case1993-05-04Paper
Complete efficiency and the initialization of algorithms for multiple objective programming1992-06-28Paper
An all-linear programming relaxation algorithm for optimizing over the efficient set1992-06-26Paper
Using efficient feasible directions in interactive multiple objective linear programming1992-06-26Paper
A branch and bound-outer approximation algorithm for concave minimization over a convex set1991-01-01Paper
Concave minimization via conical partitions and polyhedral outer approximation1991-01-01Paper
A note on adapting methods for continuous global optimization to the discrete case1990-01-01Paper
Separable concave minimization via partial outer approximation and branch and bound1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32008861990-01-01Paper
On the structure and properties of a linear multilevel programming problem1989-01-01Paper
An algorithm for optimizing over the weakly-efficient set1986-01-01Paper
The interactive fixed charge linear programming problem1986-01-01Paper
Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients1986-01-01Paper
On the optimal value function for certain linear programs with unbounded optimal solution sets1985-01-01Paper
Multiple Objective Linear Programming with Parametric Criteria Coefficients1985-01-01Paper
A finite algorithm for concave minimization over a polyhedron1985-01-01Paper
Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming1985-01-01Paper
Optimization over the efficient set1984-01-01Paper
Efficiency and proper efficiency in vector maximization with respect to cones1983-01-01Paper
On a domination property for vector maximization with respect to cones1983-01-01Paper
On the convergence of two branch-and-bound algorithms for nonconvex programming problems1982-01-01Paper
Admissible points of a convex polyhedron1982-01-01Paper
Algorithms for parametric nonconvex programming1982-01-01Paper
Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program1981-01-01Paper
An improved definition of proper efficiency for vector maximization with respect to cones1979-01-01Paper
Vector maximization with two objective functions1979-01-01Paper
Existence of efficient solutions for vector maximization problems1978-01-01Paper
The Vector Maximization Problem: Proper Efficiency and Stability1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Harold P. Benson