Učitavanje...
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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
1978
|
| Teme: | |
| Online pristup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC392390/ https://ncbi.nlm.nih.gov/pubmed/16592514 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|