haku: @indexterm mathematics / yhteensä: 51
viite: 6 / 51
| Tekijä: | Stojkovic, N.V. Stanimirovic, P.S. |
| Otsikko: | Two direct methods in linear programming |
| Lehti: | European Journal of Operational Research
2001 : JUN, VOL. 131:2, p. 417-439 |
| Asiasana: | GAME THEORY LINEAR PROGRAMMING MATHEMATICS |
| Kieli: | eng |
| Tiivistelmä: | In this paper, the authors introduce two direct methods for solving some classes of linear programming problems. The first method produces the extreme vertex or a neighboring vertex with respect to the extreme point. The second method is based on the game theory. Both these methods can be used in the preparation of the starting point for the simplex mehtod. |
SCIMA