In a linear programming (LP) problem, if the slack value for a particular constraint is negative, it indicates:Group of answer choicesThe constraint is not feasible and cannot be satisfied.The constraint is binding, and all resources are fully utilized.The constraint has surplus resources and is not fully utilized.The slack value cannot be negative; it is always positive.

Suppose we have the following LP model.Maximize Z = 10X + 5YSubject to:3X + 3Y ≤ 6 (Constraint 1)2X + 4Y ≥ 6 (Constraint 2)X, Y ≥ 0It came to be that the optimal solution is X = 1 and Y = 1. Which of the following options is a correct statement?Group of answer choicesConstraint 1 is a binding constraint, and constraint 2 is a non-binding constraint.Constraint 1 is a non-binding constraint, and constraint 2 is a binding constraint.Both constraints 1 and 2 are binding constraints.Both constraints 1 and 2 are non-binding constraints.

Nonnegativity constraints ensure that _____.Group of answer choicesthe solution to the problem will contain only nonnegative values for the decision variablesthere are no inequalities in the constraintsthe problem modeling includes only nonnegative values in the constraintsthe objective function of the problem always returns maximum quantities PreviousNext

Linear Programming(LP)（part 2）

Modelling a fixed cost problem as an integer linear program requiresGroup of answer choicesadding the fixed costs in the objective function.using 0-1 variables.using multiple-choice constraints.using LP Relaxation.

For a non-binding constraint of a maximization linear programming, the increase in shadow price:Group of answer choiceswill increase the objective function value.will decrease the objective function value.will not change the objective function value.might increase or decrease the objective function value.