A set of geometric programming test problems and their solutions

DOI10.1007/BF01580667zbMath0349.90066OpenAlexW2011540169MaRDI QIDQ4120280

Ron S. Dembo

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580667

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• A modified convace simplex algorithm for geometric programming
• Unnamed Item
• Unnamed Item

Related Items (40)

Global optimization of signomial geometric programming problems ⋮ Experiments with successive quadratic programming algorithms ⋮ Penalty functions, Newton's method, and quadratic programming ⋮ A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ Best practices for comparing optimization algorithms ⋮ A robust algorithm for quadratic optimization under quadratic constraints ⋮ An infeasible interior-point algorithm for solving primal and dual geometric programs ⋮ Computational experience with penalty-barrier methods for nonlinear programming ⋮ A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming ⋮ Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization ⋮ Reversed geometric programming: A branch-and-bound method involving linear subproblems ⋮ Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ Performance of several nonlinear programming software packages on microcomputers. ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming ⋮ Scaling nonlinear programs ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras ⋮ An analytical approach to global optimization ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ Investigating a hybrid simulated annealing and local search algorithm for constrained optimization ⋮ NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION ⋮ Linearization method of global optimization for generalized geometric programming ⋮ Remarks on solutions to a nonconvex quadratic programming test problem ⋮ An ellipsoid algorithm for nonlinear programming ⋮ ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods ⋮ Current state of the art of algorithms and computer software for geometric programming ⋮ A global interior point method for nonconvex geometric programming ⋮ Test example for nonlinear programming codes ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables ⋮ An interior point potential reduction method for constrained equations ⋮ An SQP method for general nonlinear programs using only equality constrained subproblems ⋮ A new technique for inconsistent QP problems in the SQP method ⋮ Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems ⋮ New geometric programming algorithms with numerical experiments ⋮ Comparative assessment of algorithms and software for global optimization

This page was built for publication: A set of geometric programming test problems and their solutions