All linear programming problems have all of the following properties EXCEPT
A set of linear constraints
Variables that are all restricted to nonnegative values
Alternative optimal solutions
A linear objective function that is to be maximized or minimized
Optimal solution if it exists is unique
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......
Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is