(.) False
the LP formulation of the problem will have nine constraints
<h3 /><h3>What is Linear Programming (LR)?</h3>
A mathematical model whose needs are expressed by linear relationships can be optimized using linear programming (LP), also known as linear optimization. Examples of this include maximizing profit or minimizing expense. In the context of mathematical programming, linear programming is a specific kind (also known as mathematical optimization).
Formally, linear programming is a method for optimizing a linear objective function under the restrictions of linear equality and linear inequality. A convex polytope, which is a set determined by the intersection of a finite number of half-spaces, each of which is determined by a linear inequality, is the convex region that is feasible for the set. An affine (linear) function defined on this polyhedron in real values serves as the function's aim. If such a point exists, a linear programming technique locates the polytope point where this function has the least (or biggest) value.
To know more about Linear Programming (LR) visit:- brainly.com/question/18121484
#SPJ4
