# Constraints in linear programming

Decision variables are used as mathematical symbols representing levels of activity of a firm. Parameters are the numerical coefficients and constants used in the objective function and constraint equations. Likewise, constraints are restrictions placed on the firm by the operating environment stated in linear relationships of the decision variables. Constraints illustrate all the possible values that the variables of a linear programming problem may require. They typically represent resource constraints, or the minimum or maximum level as explained below:

Assume: X1, X2, X3, ………, Xn to be decision variables of an activity

Z = Objective function or linear function

Requirement: Maximization of the linear function Z.

Z = c1X1 + c2X2 + c3X3 + ………+ cnXn …..Eq (1)

subject to the following constraints:

a11x1 + a12x2 + … + a1nxn (≤, =, ≥) b1

a21x1 + a22x2 + … + a2nxn (≤, =, ≥) b2

:

am1x1 + am2x2 + … + amnxn (≤, =, ≥) bm

In this case, aij, bi, and cj are given constants where:

xj = decision variables

bi = constraint levels

cj= objective function coefficients

aij = constraint coefficients

1. the function Z is the objective function.
2. x1, x2, . . . ,xn are the decision variables.
3. the expression (≤, =, ≥) means that each constraint may take any one of the three signs.
4. cj (j = 1, . . . , n) represents the per unit cost or profit to the j th variable.
5. bi (i = 1, . . . , m) is the availability of the ith constraint.
6. x1 , x2 , . . . , xn ≥ 0 is the set of non-negative restriction on the linear function.

Resource constraints are accepted as the common type of constraint wherein the coefficient aj,i indicates the amount of resource j that is needed for each unit of activity i, shown by the value of the variable Xi. The RHS of the constraint (bj )shows the total amount of resource j that is available for the activity. The constraint above can be written as a using both ≤ ,≥ inequalities. A greater-than-or-equal constraint is converted to a less-than-or-equal by factoring X-1. Similarly, equality constraints can be written as two inequalities — a less-than-or-equal constraint and a greater-than-or-equal constraint.

The variables of linear programs must always take non-negative values which means that the values are greater than or equal to zero). The variables can show the levels of a set of activities or the amounts of some resources used. Such a non-negativity requirement will be reasonable and even necessary. In the rare case where you want to allow a variable to take on a negative value, there are certain formulation “tricks” that can be employed. These “tricks” also are beyond the scope of this class, however, and all the variables we will use will only need to take on non-negative values.

Example: How many bowls and mugs should be produced to maximize profits given labour and materials constraints?

Product resource requirements and unit profit:

Resource 40 hrs of labor per day

Availability: 120 lbs of clay

Decision Variables x1 = number of bowls to produce per day and x2 = number of mugs to produce per day

Objective Maximize Z = $40x1 +$50x2

Function: Where Z = profit per day

Resource 1x1 + 2x2 40 h labor

Constraints: 4x1 + 3x2 120 lbs clay

Non-Negativity Constraints: x1 0; x2 0

Complete Linear Programming Model:

Maximize Z = $40x1 +$50x2

subject to: 1x1 + 2x2 40

4x1 + 3x120

x1, x0