Bricker Dennis L.

Dennis L. Bricker

Information about the author Dennis L. Bricker will soon be added to the site.
Found 10 papers in total
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
2002
An article entitled: ‘A Note on Modeling Multiple Choice Requirements for Simple...
Investigation of path-following algorithms for signomial geometric programming problems
Investigation of path-following algorithms for signomial geometric programming problems
1997
This paper considers signomial geometric programming (GP) dual problems, a class of...
Computational comparison on the partitioning strategies in multiple choice integer programming
Computational comparison on the partitioning strategies in multiple choice integer programming
1996
In this paper we review the theoretical background of two partitioning strategies, the...
Effectiveness of a geometric programming algorithm for optimization of machining economics models
Effectiveness of a geometric programming algorithm for optimization of machining economics models
1996
Machining economics problems usually contain highly non-linear equations which may...
Geometric programming with several discrete variables: Algorithms employing generalized Benders’ Decomposition
Geometric programming with several discrete variables: Algorithms employing generalized Benders’ Decomposition
1995
Geometric programming problems in which several of the variables are restricted to...
On geometric programming problems having negative degrees of difficulty
On geometric programming problems having negative degrees of difficulty
1993
The dual of a geometric programming problem with negative degree of difficult is often...
New infeasible interior-point algorithm based on monomial method
New infeasible interior-point algorithm based on monomial method
1996
The authors propose a new infeasible path-following algorithm for the convex...
On subsidiary problems in geometric programming
On subsidiary problems in geometric programming
1992
When a dual-based procedure is used to solve a geometric programming problem, the...
Obtaining a feasible geometric programming primal solution, given a near-optimal dual solution
Obtaining a feasible geometric programming primal solution, given a near-optimal dual solution
1995
A dual algorithm applied to a posynomial geometric programming problem generally...
On the calculation of true and pseudo penalties in multiple choice integer programming
On the calculation of true and pseudo penalties in multiple choice integer programming
1991
The general solution approach leading to the global optimum for multiple choice...
Papers per page: