The linear programming problem entails an optimising process in which

nonnegative values for a set of decision variables x₁,…, x_n are selected so as to

maximise (or minimise) an objective function in the form

subject to resource constraints

The a_mn , b_m and c_n coefficients are given constants.

The constraints can be also stated with equal-to signs (=) or greater-than-or-equal-to signs .

The solution provided by linear programming is the set of values of the decision variables that achieves the desired maximum (or minimum) within all constraints.