Solving a class of geometric programming problems by an efficient dynamic model (Q391472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6244263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a class of geometric programming problems by an efficient dynamic model |
scientific article; zbMATH DE number 6244263 |
Statements
Solving a class of geometric programming problems by an efficient dynamic model (English)
0 references
10 January 2014
0 references
neural network
0 references
geometric programming
0 references
convex programming
0 references
convergent
0 references
stability
0 references
0.8182687759399414
0 references
0.7973414063453674
0 references
0.7867752909660339
0 references
0.7855666875839233
0 references
