Answer:<\/strong><\/p>\n\n\n\nLinear programming deals with the optimization (maximization or minimization) of a linear function, called objective function, involving number of variables, subject to the set of variables, subject to the set of linear equalities and for inequalities called constraints and variables should be non-negative.<\/p>\n\n\n\n
ACCORDING TO SAMUELSON AND SLOW<\/u><\/strong><\/p>\n\n\n\n\u201c The analysis of problems in which a linear function of variables is to be maximised or minimised when these variables are subjected to number of constraints in the form of linear inequalities.\u201d<\/p>\n\n\n\n
ACCORDING TO WILLIAM M. FOX<\/u><\/strong><\/p>\n\n\n\n\u201cLinear programming is a planning technique that permits some objective function to be minimized or maximized within the framework of given situational restrictions.\u201d<\/p>\n\n\n\n
In linear programming, \u2018Linear\u2019 means that all the relation used in the problems are linear whereas \u2018programming\u2019 stands for the process of finding a plan of action.<\/p>\n\n\n\n
HISTORY: <\/u><\/strong>The technique of linear programming was formulated by a Russian mathematician L.V. Kantorovich. But the present version of simplex method was developed by George B. Dentzig in 1947. Linear programming (LP) is an important technique of operations research developed for optimum utilization of resources.<\/p>\n\n\n\n