Algorithms for non-convexS n -games

DOI10.1007/BF01588975zbMath0374.90084OpenAlexW2044589332MaRDI QIDQ4152068

Marvin D. Troutt

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588975

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (1)

Essentially finite algorithms for minimizing a class of convex piecewise polynomial functions

Cites Work

• Unnamed Item
• The Cutting-Plane Method for Solving Convex Programs
• The associated maximization problem for separable games
• The Supporting Hyperplane Method for Unimodal Programming
• A Derivative Test for Finite Solutions of Games

This page was built for publication: Algorithms for non-convexS n -games