\(NP\)-hardness of linear multiplicative programming and related problems (Q2564608)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(NP\)-hardness of linear multiplicative programming and related problems |
scientific article |
Statements
\(NP\)-hardness of linear multiplicative programming and related problems (English)
0 references
15 January 1997
0 references
linear fractional programming
0 references
multi-ratio programming
0 references
linear multiplicative programming
0 references
linear inequality constraints
0 references
NP-hardness
0 references
0 references
0 references
0 references
0 references
0 references
