A modified reduced gradient method for dual posynomial programming (Q1243245): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: The Convex Simplex Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5564917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4051876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5557595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5666398 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4097100 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00933407 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3122908277 / rank | |||
Normal rank |
Latest revision as of 09:34, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A modified reduced gradient method for dual posynomial programming |
scientific article |
Statements
A modified reduced gradient method for dual posynomial programming (English)
0 references
1978
0 references