To know the factors that are never a requirement of a linear programming object, we will be considering the factors that are requirements for a linear programming problem. Thus, anything outside them would be an answer to our question. The requirements of a linear programming problem actually include a function of objective that is expressed in linear term; constraints that are expressed as inequalities or linear equations; an objective function that is to be minimized or maximized, and finally, an alternative courses of action.
In other words, the requirements of a linear programming problem are Decision variable and the relationship between them, the well-defined function of objective, the presence of constraints, alternative courses of action; and non-negative restriction.
This is another way whereby the requirements of linear programming problem can be presented. Hence, any option outside these is not a requirement of a linear programming problem.
Linear programming (LP) is to do with optimization- the best way of solving a problem or a route to solution. LP makes a few simplifying assumptions but it can help solve some very complex optimization problems. For instance, the best route to take when deliveries need to be made to several locations around a city.
There are several options, but one or two will be the quickest, and therefore in saving time, will save money for the organization. This is only one example, but all LP works within limitations, has a focused intent, or goal (time-saving in the example above) and seeks the best, the optimal outcome for the problem set.