MATH 251 ACTIVITY 1: Formulating Linear Programming models, Solution concepts
WHY: Linear programming is the best-known and most commonly-used mathematical programming tools. The business
of writing software to implement solution methods is, itself, a million-dollar industry, and research for better
algorithms continues [Bell laboratories has copyrighted one]. The human part of this involves identifying and
setting up the models and interpreting the results of computations. Here we begin with some small examples.
VOCABULARY:
solution
feasible solution
feasible region
extreme point
boundary point
interior point
optimal solution
LEARNING OBJECTIVES:
1. Work as a team, using the team roles.
2. Be able to determine the variables and objective, and write the constraints, for a problem that fits the linear programming
model.
3. Understand the meanings of the feasible region for a linear programming problem
4. Understand why the optimal solution is at an extreme point of the feasible region
CRITERIA:
1. Success in completing the exercises.
2. Success in working as a team
3. Understanding of the material by all team members
RESOURCES:
1. Your text sections 2.2 – 2.3 [Setup example and graphical solution]
2. The two worked examples in the document “Setup and graphical solution of Linear Programming Problems [2-variables]”
available on the Blackboard site
3. 50 minutes
PLAN:
1. Select roles, if you have not already done so, and decide how you will carry out steps 2 and 3 (5 minutes)
2. Work through the exercises given below – you will submit one (team) copy of the work, with the usual reports [see the
syllabus]
3. Assess the team's work and roles performances and prepare the Reflector's and Recorder's reports including team grade (5
minutes).
4 Be prepared to discuss your results.
