QUESTION 1 Linear Programming Model Objective Constraints Nonnegativity Constraints Feasible Solution Optimal Solution Simplex Method Sensitivity Analysis Algebraic Model Spreadsheet Model A. An "educated guess" solution, not guaranteed to be optimal but usually quick and easy to obtain B. Amount the objective coefficient of a variable currently equal to 0 must change before it is optimal for that variable to be positive. C. The value to be optimized in an optimization model D. Cell that contains the value of the objective E. A model that uses spreadsheet formulas to express the logic of a model F. When several solutions have the same optimal value of the objective G. Any optimization model, whether linear, integer, or nonlinear H. Seeing how the optimal solution changes as various input changes 1. An optimization model with linear objective and linear constraints J. The feasible solution that has the best value of the objective function K. A constraint that holds as an equality L. The variables the decision maker has control over to effect better solutions M. A constraint where there is a difference, called the slack, between the two sides of the inequality N. The change in the objective for a change in the right-hand side of a constraint O. Add-in with Excel used for performing optimization P. Conditions that must be satisfied in an optimization model Q. An efficient algorithm for finding the optimal solution in a linear programming model R. Condition where a model has feasible solution S. Constraints that require the decision variables to be nonnegative T. Condition where there is no limit to the objective U. Shows the constraints and objective graphically so the optimal solution can be identified V. A solution that satisfies all of the constraints W. A model that expresses the constraints and objective algebraically X. Cells that contain the values of the decision variables Y. Constraints that limit the changing cell to integer values Graphical Solution Binding Constraint Nonbinding constraint Reduced Cost Shadow Price Mathematical Programming Model Infeasibility Unboundedness Changing Cells Target Cell Solver Integer Constraints Multiple Optimal Solutions Heuristic Decision Variables