- Statement (I) is true because in a Linear Programming Problem (LPP), the objective function is always linear. It is of the form \( c_1x_1 + c_2x_2 + \dots + c_nx_n \), where \( x_1, x_2, \dots, x_n \) are decision variables and \( c_1, c_2, \dots, c_n \) are constants.
- Statement (II) is also true because in an LPP, the constraints are the linear inequalities on the decision variables, such as \( a_1x_1 + a_2x_2 + \dots \leq b \), which limit the possible values of the decision variables.
Thus, both statements are true.