In a linear programming problem, the constraints are:constraint 1: 9x1 + 28x2 ≤ 63constraint 2: 16x1 + 52x2 ≤ 211What value from constraint 2 can the slope of the objective function not exceed in order for the optimal solution point to remain optimal?Another way to ask this is, what's the slope of constraint 2?Round your solution to 2 decimal places.

Consider the following linear programming problem:Max     Z = 11 x1 + 11 x2s.t.       20 x1 + 10 x2 ≤ 60       (constraint I)            x1 + 2 x2 ≤ 6     (constraint II)            x1, x2 ≥ 0The constraint lines and optimal solution are illustrated in the following figure:What is the lower bound of the X2 coefficient (C2) in the objective function, that doesn't change the optimal solution?(Round to one decimal place.)

What does the objective function represent in a Linear Programming Problem?  A. Constraints that must be satisfied  B. A linear combination of decision variables  C. The feasible region of the problem  D. The maximum number of variables

What is the term used to describe a solution to a Linear Programming Problem where the objective function has the maximum possible value?  A. Optimal solution  B. Infeasible solution  C. Unbounded solution  D. Feasible solution

In an Linear programming problem, the restrictions or limitations under which the objective function is to be optimized are called

Consider the following integer linear programming model:Max Z = 5x1 + 6x2Subject to:17x1 + 8x2 ≤ 1363x1 + 4x2 ≤ 36x1, x2 ≥ 0 and integerWhat is the value of the objective function at the optimal solution?Hint: develop a simple integer programming model in Excel to solve this problem.