Question

How do you do linear programming?

Answer 1

$Linearprogramming(L.P)$is defined as the problem of maximizing or minimizing a linear function, i.e. an objective function which is subjected to linear constraints. This is also called a Linear Optimization technique. The step in solving a $\mathrm{Linear}\mathrm{programming}$ is to identify the objective function and constraints. Based on these inequality equations we can define the method for solving linear programming. Solving these inequalities results in the feasible solution of the given $\mathrm{Linear}\mathrm{programming}$.

Steps to Linear Programming

1. Understand the problem. ...
2. Describe the objective. ...
3. Define the decision variables. ...
4. Write the objective function. ...
5. Describe the constraints. ...
6. Write the constraints in terms of the decision variables. ...
7. Add the nonnegativity constraints. ...
8. Maximize.

Hence, in this we way we can do linear programming.