Linear programming is associated with different sets of problems.
The several types of linear programming problems are discussed here:
In the manufacturing problem, we have to maximize the profit by minimizing the utilization of resources.
In the diet problem, we have to determine the total number of several nutrients in the diet, so the manufacturing cost gets minimized.
In the transportation problem, we have to determine the schedule for the cheapest way of product transportation. So that product will get dispatched at a minimum price.
A straight capacity of the structure Z = ax + by, where an and b are consistent, which must be limited or expanded, is known as a direct goal work. Like Z = 175x + 150y.
The straight disparities or conditions or limitations on the factors of LPP are called imperatives. The circumstances x ≥ 0 and y ≥ 0 are called non-negative limitations. Like 5x + y ≤ 100; x + y ≤ 60.
These are the focuses inside and on the limit of the achievable district address practical arrangements of the imperatives. Any point outside the practical district is called an infeasible arrangement.