Name: Class/Set:

Discrete - Linear Programming Terms www..mathsprint.co.uk

1
1: Give
2 the following Linear Programming terms:
a) A quantity that can be changed in the problem (e.g. representing a physical quantity)

____________________
b) The point on the (x,y) plane giving the best solution to the problem

____________________
c) Find the largest value of

____________________
d) An inequality corresponding to a restriction on the problem

____________________
e) The statement of a problem as a function to be optimised, with a set of inequalities

____________________
f) An inequality showing that a quantity cannot be less than zero

____________________
g) Find the smallest value of

____________________
h) A corner of the region of allowable points

____________________
i) The function to be optimised (minimised or maximised)

____________________
j) The set of all allowable points on the (x,y) plane

____________________

Free worksheet created by MATHSprint. Discrete - Linear Programming Terms:1 MATHSprint, 2013
 1
2: Define
2 the following Linear Programming terms:
a) Optimal solution b) Maximise

____________________ ____________________
c) Minimise d) Control variable

____________________ ____________________
e) Linear Programming (LP) formulation f) Constraint

____________________ ____________________
g) Non-negativity constraint h) Vertex

____________________ ____________________
i) Feasible region j) Objective function

____________________ ____________________

Free worksheet created by MATHSprint. Discrete - Linear Programming Terms:1 MATHSprint, 2013
Answers: Discrete - Linear
Programming Terms www..mathsprint.co.uk

1
1: 2a) Control variable
b) Optimal solution
c) Maximise
d) Constraint
e) Linear Programming (LP) formulation
f) Non-negativity constraint
g) Minimise
h) Vertex
i) Objective function
j) Feasible region

1
2: 2a) The point on the (x,y) plane giving the best solution to the problem
b) Find the largest value of
c) Find the smallest value of
d) A quantity that can be changed in the problem (e.g. representing a physical quantity)
e) The statement of a problem as a function to be optimised, with a set of inequalities
f) An inequality corresponding to a restriction on the problem
g) An inequality showing that a quantity cannot be less than zero
h) A corner of the region of allowable points
i) The set of all allowable points on the (x,y) plane
j) The function to be optimised (minimised or maximised)

Free worksheet created by MATHSprint. Discrete - Linear Programming Terms:1 MATHSprint, 2013