Linear Programming pge 154

Every LP problem is composed of:

• decision variables (who's values are unknown and are searched for),
• an objective function (a linear mathematical function that relates the decision variables to the goal, measures goal attainment, and is to be optimised),
• objective function coefficients (unit profit or cost coefficients indicating the contribution to the objective of one unit of a decision variable),
• constraints (expressed in the form of linear inequalities or equalities),
• capacities (upper, lower limits of variables), and
• input/output coefficients.