Definitions

Question 1

Feasible region (solution space)

Answer 1

The set of all points satisfying all constraints an sign restrictions

Question 2

Optimal solution

Answer 2

The point(s) at which a linear programme’s objective function has been minimised/ maximised.

Question 3

Binding constraint

Answer 3

A constraint is binding if LHS=RHS when the optimal solution is substituted into the constraint.

Question 4

Non-binding constraint

Answer 4

LHS is not equal to RHS when the optimal solution is substituted into the constraint.

Question 5

Extreme point

Answer 5

A point that lies on the end point of a line segment that is completely in the solution spacce.

Question 6

Standard form

Answer 6

The linear objective should be maximised subject to a set of linear constraints.

Question 7

Canonical form

Answer 7

Every basic variable has a coefficient of 2 in exactly 1 equation and 0 in all other equations, an every equation has at least 1 basic variable.

Question 8

Basic soultion

Answer 8

Obtained by setting n-m (non-basic variables) of the variables equal to 0 and solving for the remaining m variables (basis variables).

Question 9

Basic feasible solution

Answer 9

Any basic solution in which all the basic variables have non-negative values.

Question 10

Extreme point of a convex set

Answer 10

Let S be a convex set. A point X in S in an extreme point of S if no points X1, X2 in S exist with X1 not equal to X2 and 0<a></a>