A
decorative item dealer deals in only two items - wall hangings and artificial
plants. He has 15,000 dollars to invest and a space to store all the most 80
pieces. A wall hanging costs him 300 dollars and an artificial plant 150
dollars. He can sell a wall hanging at a profit of 50 dollars and an artificial
plant at a profit of 18 dollars. Assume that he can sell all the items that he
buys. Let us make a mathematical model to maximize his profit with the given
conditions.
Note
that in both the examples the conditions are linear inequalities; these
mathematical models which tells to optimize (minimize or maximize) the
objective function Z subject to certain condition on the variables is called a
Linear programming problem (LPP).