Food-Processing-Plant-Design-layout
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Food Processing Plant Design & layout
where C is the total cost of production, and C1, C2, C3 and C4 are unit costs of products A,
B, C and D respectively.
3. Constraints (Inequalities). These are the restrictions imposed on decision variables. These
may be in terms of availability of raw materials, machine hours, man hours etc. Suppose
each of the above items A, B, C and D requires t1, t2, t3 and t4 machine hours respectively.
The total machine hours are T hours, and this is a constraint.
Therefore it can be expressed as:
Q1 t1 + Q2 t2 + Q3 t3 + Q4 t4 < T
4. Non-Negative Condition. The linear programming model essentially seeks that the
values for each variable can either be zero or positive. In no case it can be negative. For the
products A, B, C and D the non-negative conditions can be :
Q1 > 0
t1 > 0
Q2 > 0 t2 > 0
and also
Q3 > 0 t3 > 0
Q4 > 0 t4 > 0
This implies that quantity produced can be at the most zero and not below that. Similarly,
the machine hours expended for each unit A, B, C and D can be at the most zero and in no
case it can be negative.
5. Linear Relationship. It implies straight line or proportional relationship among the
relevant variables. It means change in one variable produces proportionate change in other
variables.
6. Process and its Level. Process represents to produce a particular output. If a product can
be produced in two different ways, then there are two different processes or decision
variables for the purpose of linear programming.
7. Feasible Solution. All such solutions which can be worked out under given constraints
are called "feasible solutions" and region comprising such solution is called the "feasible
region".
8. Optimum Solution. Optimum means either maximum or minimum. The object of
obtaining the feasible optimum solution may be maximization of profit or minimization of
cost. Optimum solution is the best of all feasible solutions.
14.4.1 Assumptions in Linear Programming
There is a well-defined objective function such as maximizing profit or minimizing
cost.
There are a number of restrictions or constraints (on the amount and extent of
available resources for satisfying the objective function) which can be expressed in
90 www.AgriMoon.com