Question $1$

In linear programming problems the objective function represents

a$.$ the mathematical equation showing the quantity to be maximised

b$.$ the mathematical equation showing the quantity to be optimised

c$.$ the spare resources to be allocated

d$.$ the constraints to be met

Question $2$

Which of the following should always be included in the objective function of a linear programming problem?

a$.$ the constraints

b$.$ the decision variables

c$.$ the spare resources

d$.$ the limited resources

Question $3$

Can a linear programming problem have more than two decision variables?

a$.$ No

b$.$ Yes

c$.$ Yes $-$ provided it also has more than two constraints

Question $4$

An infeasible linear programming problem is one in which

a$.$ some of the constraints appear as equations rather than inequalities

b$.$ the area of feasibility does not form a polygon

c$.$ there is no optimal solution

d$.$ none of the above