Fundamental Theorems. Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function.When Z has an optimal value (maximum or ...

Goal programming Numerical example. In order to reveal the ‘mechanics’ of achievement functions, we use a simplified diet model with two foods: (1) bread and (2) meat, with associated decision ...

Theorem 2: Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function.If R is bounded**, then the objective function Z has both a maximum and a ...