Linear Programming
Problem (LPP)
Linear programming problem is one that is concerned with finding the
maximum or minimum value of a linear function of several variables,
subject to conditions that the variables are non-negative and satisfy a
set of linear inequalities.
Note: Variables are sometimes called decision variables.
Objective Function
The linear function which is to be optimised (maximised/minimised) is
called an objective function.
Constraints
The system of linear inequations under which the objective function is
to be optimised is called constraints.
Non-negative Restrictions
All the variables considered for making decisions assume non-negative
values.
Optimal Value
The maximum or minimum value of an objective function is known as
the optimal value of LPP.
Mathematical Description of a General Linear
Programming Problem
A general LPP can be stated as (Max/Min)
Z = c1x1 + c2x2 + ... + cn xn (Objective function) subject to constraints
Problem (LPP)
Linear programming problem is one that is concerned with finding the
maximum or minimum value of a linear function of several variables,
subject to conditions that the variables are non-negative and satisfy a
set of linear inequalities.
Note: Variables are sometimes called decision variables.
Objective Function
The linear function which is to be optimised (maximised/minimised) is
called an objective function.
Constraints
The system of linear inequations under which the objective function is
to be optimised is called constraints.
Non-negative Restrictions
All the variables considered for making decisions assume non-negative
values.
Optimal Value
The maximum or minimum value of an objective function is known as
the optimal value of LPP.
Mathematical Description of a General Linear
Programming Problem
A general LPP can be stated as (Max/Min)
Z = c1x1 + c2x2 + ... + cn xn (Objective function) subject to constraints
