Intelligent gradient search in linear programming
✍ Scribed by W. Nickels; W. Rödder; L. Xu; H.-J. Zimmermann
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 930 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract This paper proposes a solution to mixed‐integer programming by using a gradient system and searching for multiple equilibrium points in the system. The method is available when the objective function of a problem is continuous and differentiable. In order to find feasible solutions of a
In his 1950 paper entitled, "Programming a Computer to Play Chess" [3], Shannon laid out the theory of minimax search with bounded lookahead and static heuristic evaluation, the basis of almost all subsequent work on two-player games. Along with Allen Newell, Herbert Simon established the idea of he