CHARACTERISTICS OF LINEAR PROGRAMMING

B.) CONSTRAINTS
The constraints are the restrictions or limitations on the decision variables. They usually
limit the value of the decision variables. All constraints (limitations) regarding resources
should be fully spelt out in mathematical form.
FROM THE PROBLEM: The company will try to produce as many units of A and B to
maximize the profit. But the resources Milk and Choco are available in limited amount.
In the above example, the limit on the availability of resources milk and choco are the
constraints.

CONSTRAINTS:
MILK: X+Y ≤ 5
CHOCO: 3X+2Y ≤ 12

C.) NON-NEGATIVITY
The value of variables must be zero or positive and not negative. For all linear
programs, the decision variables should always take non-negative values. Which means
the values for decision variables should be greater than or equal to 0.
For example, in the case of production, the manager can decide about any product
number in positive or minimum zero, not the negative.

NON-NEGATIVITY
RESTRICTION:
PRODUCT A: X ≥ 0
PRODUCT B: Y ≥ 0
 DEFINITION OF MINIMIZATION OF COST UNDER OBJECTIVE FUNCTION
Cost minimization is a basic rule used by producers to determine what mix of labor and
capital produces output at the lowest cost. In other words, what the most cost-effective
method of delivering goods and services would be while maintaining a desired level of
quality.

Min Cost = 0.3 X1 + 0.9 X2

X1 + X2 ≥ 800
PROTEIN: 0.09 X1+ 0.6 X2 ≥ 0.3 (X1 + X2)
FIBER: 0.02 X1+ 0.06 X2 ≤ 0.05 (X1 + X2)
1. X1 + X2 ≥ 800
2. 0.21 X1 – 0.3 X2 ≤ 0
3. 0.03 X1 – 0.01 X2 ≥ 0
4. X1 ≥ 0
5. X2 ≥ 0
Solving (1) & (2) X1 = 470.59 lb. X2 = 329.41 lb.

(1) & (2): Min Cost = 0.3 (470.59) + 0.9 (329.41)

(1) & (2): Min Cost = $ 436.65 / day