𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Modified fictitious play for solving matrix games and linear-programming problems

✍ Scribed by Saul I. Gass; Pablo M.R. Zafra

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
795 KB
Volume
22
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Ξ¨-transform for solving linear and n
The Ξ¨-transform for solving linear and non-linear programming problems
✍ V.K. Chichinadze πŸ“‚ Article πŸ“… 1969 πŸ› Elsevier Science 🌐 English βš– 710 KB

The global extremum value, as well as its coordinates, of a non-linear multidimensional objective function may be found approximately, but practically, as the zero value of its transformation, a monotonically decreasing scalar function. Summary--This paper is concerned with the problem of determinin

A steepest edge active set algorithm for
A steepest edge active set algorithm for solving sparse linear programming problems
✍ S. W. Sloan πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations