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 ...

The decision variables are variously partitioned into continuous and discrete sets. The leader goes first, and through his choice may influence but not control the responses available to the follower.

Two Variables: Graphical Solution For cases like the one we have here, where there are just two decision variables, there is a quick and easy solution method. This method involves graphical ...

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 ...