The following pages link to Harold P. Benson (Q229676):
Displaying 50 items.
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
- (Q597194) (redirect page) (← links)
- Generating sum-of-ratios test problems in global optimization (Q597195) (← links)
- Using concave envelopes to globally solve the nonlinear sum of ratios problem (Q598606) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- On the optimal value function for certain linear programs with unbounded optimal solution sets (Q795745) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- Continuous modular design problem: analysis and solution algorithms (Q868591) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
- Efficiency and proper efficiency in vector maximization with respect to cones (Q1055343) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
- An improved definition of proper efficiency for vector maximization with respect to cones (Q1131964) (← links)
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems (Q1149236) (← links)
- Admissible points of a convex polyhedron (Q1157772) (← links)
- Algorithms for parametric nonconvex programming (Q1158344) (← links)
- On a domination property for vector maximization with respect to cones (Q1161684) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- Using efficient feasible directions in interactive multiple objective linear programming (Q1178731) (← links)
- Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391) (← links)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
- Vector maximization with two objective functions (Q1244175) (← links)
- Existence of efficient solutions for vector maximization problems (Q1245164) (← links)
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming (Q1264984) (← links)
- Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem (Q1265180) (← links)
- Global optimization in practice: An application to interactive multiple objective linear programming (Q1265191) (← links)
- Dynamic lot-sizing with setup cost reduction (Q1278132) (← links)
- New closedness results for efficient sets in multiple objective mathematical programming (Q1307268) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case (Q1384421) (← links)
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals (Q1424784) (← links)
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067) (← links)
- Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- Pivoting in an outcome polyhedron (Q1583685) (← links)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
