ロード中...
Clark's Theorem on linear programs holds for convex programs
Given a linear minimization program, then there is an associated linear maximization program termed the dual. F. E. Clark proved the following theorem. “If the set of feasible points of one program is bounded, then the set of feasible points of the other program is unbounded.” A convex program is th...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
1978
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC392390/ https://ncbi.nlm.nih.gov/pubmed/16592514 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|