This paper shows, by means of an example, how linear programming can be applied to obtain optimal team decision functions in the case in which the payoff to the team is a convex polyhedral function of ...

Nonstationary infinite-horizon Markov decision processes (MDPs) generalize the most well-studied class of sequential decision models in operations research, namely, that of stationary MDPs, by ...

Variables are sometimes called decision variables and are non-negative Theorem 1: Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the ...

RiverWare automatically generates and efficiently solves a multiobjective, preemptive linear goal programming formulation of a reservoir system. An advanced feature of RiverWare is that both the ...