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

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

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.