On geometric programming problems having negative degrees of difficulty (Q1309928): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the primal and dual constraint sets in geometric programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3889680 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5557595 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric programming problems with negative degrees of difficulty / rank | |||
Normal rank | |||
Latest revision as of 11:06, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On geometric programming problems having negative degrees of difficulty |
scientific article |
Statements
On geometric programming problems having negative degrees of difficulty (English)
0 references
6 January 1994
0 references
negative degree of difficulty
0 references
0 references
