# How do you know when to use Linear Programming to solve a word problem?

##### 1 Answer

Please see below.

#### Explanation:

Linear programming is a simple technique where we depict complex relationships through linear relations. These relations are constraints which put restrictions on values of the output, which are non-negative i.e. zero or positive. The results in such cases are generally located at points and then we find the most optimal point based on , at which the desired objective, which is again a linear relation among decision variables and is either maximised or minimised.

Hence, we use Linear Programming to solve a word problem when (i) we have linear relations; and (ii) certain function has to be maximized or minimized.

For example, let us have available

Let the result be

We are to maximise

and non-negative outputs are