Answer:
In order to have a linear programming problem, we must have:
Inequality constraints
An objective function, that is, a function whose value we either want to be as large as possible (want to maximize it) or as small as possible (want to minimize it).
A typical linear programming problem consists of finding an extreme value of a linear function subject to certain constraints. We are either trying to maximize or minimize the value of this linear function, such as to maximize profit or revenue, or to minimize cost. That is why these linear programming problems are classified as maximization or minimization problems, or just optimization problems. The function we are trying to optimize is called an objective function, and the conditions that must be satisfied are called constraints.
