Compromising solution of geometric programming problem with bounded parameters (Q1697901)
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: Compromising solution of geometric programming problem with bounded parameters |
scientific article; zbMATH DE number 6841402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compromising solution of geometric programming problem with bounded parameters |
scientific article; zbMATH DE number 6841402 |
Statements
Compromising solution of geometric programming problem with bounded parameters (English)
0 references
20 February 2018
0 references
interval-valued function
0 references
partial ordering
0 references
nonlinear programming
0 references
geometric programming
0 references
decision making
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7832105159759521
0 references
0.7778129577636719
0 references
0.7712013721466064
0 references
0.763207733631134
0 references
0.7618586421012878
0 references
