Scribd
Upload
207 views

l3 Linear Programming

This document provides instruction on using linear programming techniques to find optimal solutions. It outlines the general method for solving linear programming problems in 8 steps: (1) graphing lines and inequalities, (2) finding intersections of lines, (3) identifying the feasible region, (4) determining vertex coordinates, (5) evaluating the objective function at vertices, (6) identifying the optimal value, (7) considering whole number solutions if required, and (8) handling cases where multiple optimal values exist. Students are directed to practice sample problems and assessment-type tasks to develop these skills.

Uploaded by

api-287224366
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
207 views

l3 Linear Programming

This document provides instruction on using linear programming techniques to find optimal solutions. It outlines the general method for solving linear programming problems in 8 steps: (1) graphing lines and inequalities, (2) finding intersections of lines, (3) identifying the feasible region, (4) determining vertex coordinates, (5) evaluating the objective function at vertices, (6) identifying the optimal value, (7) considering whole number solutions if required, and (8) handling cases where multiple optimal values exist. Students are directed to practice sample problems and assessment-type tasks to develop these skills.

Uploaded by

api-287224366
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

KKHS Mathematics with Statistics Programme

1
Unit #3
LINEAR PROGRAMMING
Objective:
M8-4
Use linear programming techniques.
References
Sigma Textbook and Homework book (3rd ed) Ch 12
and Nulake Workbook 3.2 Linear Programming
Note: Graphics calculators may be used to assist with drawing the lines, finding intersections of lines and shading regions.
Lesson
Detail
Nulake Workbook
Graphing straight lines:
if in the form, y = mx + c use c = y-intercept first, then use m = gradient =

rise
run

to get a 2nd

point
if in the form, ax + by = c use the cover up rule
cover up the x-term, to get the y-intercept; cover up the y-term, to get the x-intercept.
- lines // x-axis have equations like:
- lines // y-axis have equations like:
- the equation of the x-axis is:
- the equation of the y-axis is:

y=c
x=k
y=0
x=0

and would cut y-axis at "c"


and would cut x-axis at "k"

1
plus
homework
time

Graph inequations: y > mx + c or y < mx + c or y < mx + c or y > mx + c


this is best done, by shading OUT that which is NOT wanted.
choose any point NOT on the line itself use (0,0) if at all possible, and substitute
that points coordinates into the inequation
If the resulting statement is true, then the point used IS on the wanted side.
If the resulting statement is untrue, then the point used is NOT on the wanted side.

Read:
pages 3-4, 5, 7-9
Follow :
Worked Examples
Do Questions #1-16

Find if and where two straight lines intersect.


- solve the equations simultaneously
by elimination (adding/subtracting appropriate multiples of the equations in order
to eliminate one of the variables, etc) or by substitution (of an expression for one
variable from one of the equations, into the other equation, etc)
- there will be a unique solution if the lines do intersect
- there will be no sensible solution if the lines are parallel

- there will be many solutions if the lines are coincident (are the same line)

2
plus
homework
time

To find the optimum solution


1. Graph one line first.
2. Graph the inequation, by shading OUT those points that do not meet the requirements of the
situation.
3. Repeat steps 1 and 2 for all the inequations involved in the problem.
4. The un-shaded area is the FEASIBLE region - a set of points, each of which satisfies the
given conditions.
5. Determine the coordinates of all the vertices of the feasible region (by solving simultaneous
equations).
6. Evaluate the objective function at each of the vertices show the information in a table
7. The optimum value of the objective function will occur at a vertex.

Read:
pages 13-15, 18
Follow :
Worked Examples
Do Questions #1728

8. If 2 vertices give the optimum value, then all points on the line between them will too.
This happens when the objective function is parallel to one side of the feasible region.

3-5
plus
homework
time

LINEAR PROGRAMMING - General Method


1. Identify 2 variables (the 2 things that give the optimum solution ).
2. Write a formula for the OBJECTIVE FUNCTION - the thing to be optimised.
3. Use the information in the question to write all the possible inequations that involve one or the
other or both variables. Remember to state the trivial ones eg. x > 0 and y > 0.
4. Graph the inequations and shade out, to find the feasible region.
5. Evaluate the objective function at each of the vertices show the information in a table
6. Give your solution to the problem, sensibly, in context. If the actual solution must involve only whole
numbers, then guessing AND CHECKING of whole number possibilities in the region of the optimum
theoretical solution must be undertaken. ENSURE the INEQUALITIES are still TRUE.
Practice assessment-type tasks: see old Statistics and Modelling papers for standard 90644
Merit = Find an optimum solution to the basic problem
Excellence investigate changed circumstances, that result in a less clear-cut situation
- and/or work in reverse, altering condition(s), to create a specified solution situation

Read:
pages 21-22
Follow :
Worked Examples
Do Questions #2944
Practice Task
Page 34-7

KKHS Mathematics with Statistics Programme


The assessment for AS91574 is internal

2
expect it in Week 11 Term 1 (Calculus course)
expect it in Week 2-3 Term 3 (Statistics course)

You might also like