Deterministic global optimization algorithms improve the quality of the obtained lower bounds by partitioning the initial hyperrectangle into smaller ones, and ...
Global optimization in generalized geometric programming
pure.psu.edu › publications › global-opti...
A deterministic global optimization algorithm is proposed for locating the global minimum of generalized geometric (signomial) problems (GGP).
Abstract--In this paper a deterministic global optimization algorithm is proposed for locating the global minimum of the generalized geometric programming ...
In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive integral degree of difficulty.
In this paper a deterministic global optimization algorithm is proposed for locatingthe global minimum of the generalized geometric programming (GGP) problem.
A deterministic global optimization algorithm is proposed for locating the global minimum of generalized geometric (signomial) problems (GGP). By utilizing ...
Local optimization approaches for solving GGP problems include bounding procedures based on posynomial condensation [2,5,13,15,23]; iterative solution of KKT ...
Jun 21, 2024 · A Deterministic Global Optimization Method for Solving Generalized Linear Multiplicative Programming Problem with Multiplicative Constraints.
In this study, a deterministic global optimization algorithm is proposed for globally solving the Nonconvex Quadratic Programming (NQP). In this algorithm, by ...
In this chapter, we discuss the theoretical and algorithmic issues in global optimization approaches for generalized geometric programming problems.