68 Multiple Choice 1 point Question at position 68 A binary mixed-integer programming problem in which the binary variables represent whether an activity, such as a production run, is undertaken or not is known as the share of choice problem. capital budgeting problem. covering problem. fixed-cost problem. Question at position 69 69 Multiple Choice 1 point Question at position 69 Geometrically, binding constraints intersect to form the zero slack. optimal point. decision cell. subspace. Question at position 70 70 Multiple Choice 1 point Question at position 70 The __________ assumption necessary for a linear programming model to be appropriate means that the contribution to the objective function and the amount of resources used in each constraint are in accordance to the value of each decision variable. negativity divisibility additivity proportionality Question at position 71 71 Multiple Choice 1 point Question at position 71 __________, or modeling, is the process of translating a verbal statement of a problem into a mathematical statement. Problem formulation Data structuring Problem-solving approach Data preparation Question at position 72 72 Multiple Choice 1 point Question at position 72 __________ is the situation in which no solution to the linear programming problem satisfies all the constraints. Optimality Divisibility Unboundedness Infeasibility Question at position 73 73 Multiple Ch