Methods Chapter 7 Linear Programming Models: Graphical and Computer 1) Management resources that need control include machinery usage, labor volume, money spent, time used, warehouse space used, and material usage. Answer: 2) Any linear programming problem can be solved using the graphical solution procedure. Answer: 3) There are no limitations on the number of constraints or variables that can be graphed to an LP problem. Answer: Diff: 1 4) Resource restrictions are called constraints. Answer: 5) The set of solution points that satisfies all of a linear programming problem's constraints simultaneously is defined as the feasible region in graphical linear programming. Answer: 6) An objective function is necessary in a maximization problem but is not required in a minimization problem. Answer: 7) In some instances, an infeasible solution may be the optimum found by the corner point method Answer: 8) The solution to a linear programming problem must always lie on a constraint. Answer: 9) In a linear program, the constraints must be linear, but the objective function may be nonlinear