6. A typical linear programming problem is characterised by an objective function to be maximised or minimised, and a set of constraints, and non-negativity condition. Mark the statement as T (True) or F (False)