Art
J-GLOBAL ID:201602006912398566   Reference number:62A0033745

A steepest-ascent method for solving optimum programming problems.

最適プログラミングを解くためのSteepest-Ascent法
Author (2):
Material:
Volume: 29  Issue:Page: 247-257  Publication year: 1962 
JST Material Number: E0270B  CODEN: JEPOA   Document type: Article
Article type: 原著論文  Country of issue: United States (USA) 
Terms in the title (1):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page