Linearization method of global optimization for generalized geometric programming (Q1763283)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linearization method of global optimization for generalized geometric programming |
scientific article; zbMATH DE number 2136177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linearization method of global optimization for generalized geometric programming |
scientific article; zbMATH DE number 2136177 |
Statements
Linearization method of global optimization for generalized geometric programming (English)
0 references
22 February 2005
0 references
An algorithm for finding the globally optimal solutions of a generalized geometric programming problem is presented. The proposed algorithm uses a convenient linearization technique to systematically convert the initial problem into a sequence of linear programming problems. For this, among others, a branch-and-bound algorithm is used. The branch-and-bound approach is based on partitioning the set of feasible solutions: bisection rule. The proposed algorithm is convergent. Three problems that appear in the literature are tested. Numerical results illustrate the feasibility and effectiveness of the proposed algorithm.
0 references
generalized geometric programming
0 references
algorithm
0 references
global optimization
0 references
linearization
0 references
branch-and-bound
0 references
convergence
0 references
numerical examples
0 references
bisection rule
0 references
0 references
0 references
0 references
0 references
0.9439813494682312
0 references
0.8896160125732422
0 references
0.8863471150398254
0 references
0.8761647939682007
0 references
