1. As long as the changes in an Objective Function coefficient are within its Range of Optimality, the currently identified optimal values for the Decision Variable will remain the best solution. Treu/false ?

2. We refer to Dual Price values when conducting Sensitivity Analysis on Decision Variables. Treu/false ?

3. In modelling a Linear Programming model, equations representing decision objectives and constraints must be written as linear equations. Treu/false ?

4. Solving Linear Programming problems using the Simplex method will always give us one best solution. Treu/false ?

5. Values for Decision Variables in Linear Programming model represented by the coordinates of points within the Feasible Region for the problem. Treu/false ?

6. Selling a combination of 3 units of X₁ and 6 units of X₂ is feasible based on the constraint 3X1+5X235 . Treu/false ?

7. When solving a minimisation Linear Programming, an unbounded feasible region may result in a bounded or an unbounded solution. Treu/false ?