组合数学
线性规划
应用数学
最优化问题
时间复杂性
线性系统
摘要
We consider a two person max—min problem in which the maximizing player moves first and the minimizing player has perfect information of the outcome of this move. The move of the maximizing player influences not only the objective function but also the constraints of the minimizing player. The joint constraints as well as the objective function are assumed to be linear.
科研通智能强力驱动
Strongly Powered by AbleSci AI