1. Linear programming problems may have only one goal or objective specified. (T / F) 2. A feasible solution is one that satisfies at least one of the constraints of a linear programming problem. (T / F) 3. Maintaining a minimum level of customer service is a good application of what type of LP problem? 4. Given the following 2 constraints, which solution is a feasible one for a maximization problem? (1) 4 X1 + 3 X2 <= 18 (2) X1 - X2 <= 3 a. (X1 , X2 ) = (1, 5). b. (X1 , X2 ) = (4, 1). c. (X1 , X2 ) = (4, 0). d. (X1 , X2 ) = (2, 1). e. (X1 , X2 ) = (2, 4)

A. When solving a minimization problem, we are solving a resource constraint problem. ( T / F) B. In a linear programming spreadsheet model, the output cells can typically be expressed as a SUMPRODUCT function. (T / F