Name
Abstract | ||
|---|---|---|
As a direct extension of Charnes' characterization of two-person zero-sum constrained games by linear programming, we show how a general class of saddle value problems can be reduced to a pair of uniextremal dual separably-infinite programs. These programs have an infinite number of variables and an infinite number of constraints, but only a finite number of variables appear in an infinite number of constraints and only a finite number of constraints have an infinite number of variables. The conditions under which the characterization holds are among the more general ones appearing in the literature sufficient to guarantee the existence of a saddle point of a concave-convex function. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1007/BF01919901 | Mathematical Methods of Operations Research |
Keywords | Field | DocType |
theorems,variables,linear programming,saddle point,convex function,game theory,linear program | Saddle,Discrete mathematics,Finite set,Saddle point,Algebra,Linear programming,Game theory,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 7 | 1432-5217 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Charnes | 1 | 271 | 145.50 |
| P. R. Gribik | 2 | 2 | 0.89 |
| K. O. Kortanek | 3 | 494 | 86.05 |