Algorithms for non-convexS n -games

DOI10.1007/BF01588975MaRDI QIDQ4152068zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3090557 (Why is no real title available?)
• A Derivative Test for Finite Solutions of Games
• The Cutting-Plane Method for Solving Convex Programs
• The Supporting Hyperplane Method for Unimodal Programming
• The associated maximization problem for separable games

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152068)