41. All negative constraints must be written asA. equalityB. non equalityC. greater than or equal toD. less than or equal to AnswerC. greater than or equal to 42. In linear programming problem if all constraints are less than or equal to, then thefeasible region isA. above linesB. below the linesC. unboundedD. none of the above…