Please just write true or false for the questions given below:

1. A stochastic model is often more difficult to be solved and analyzed compared to a deterministic model.

2. A less complicated programming model should never be considered than a more complex and accurate despite being cheaper and easier to solve.

3.. An example of an applied deterministic model is a calculation to determine the return on a 5-year investment with an annual interest rate of 7%,compounded monthly.

4. In the production of a car, the number of hours of production time required per unit, the total hours available, and the unit profit were all uncontrollable inputs that were given fixed values and can be used in a stochastic mathematical modelling.

5. A problem that is over-constrained may result with a linear programming graph that has no feasible region for solution.

6. An optimal solution to a linear programming problem can be found at any points except at the extreme point of the feasible region.