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

CBSE Class 12 Maths Chapter 12 Linear Programming Revision Notes. Basic Definitions, Theorems and Formulas. ... which has to be maximised or minimised is called a linear objective function.

Example 3.7: Goal-Programming a Product Mix Problem. This example shows how to use PROC LP to solve a linear goal-programming problem. PROC LP has the ability to solve a series of linear programs, ...