Help shape GoConqr. What should we add next?

Notes

Linear Programming

Erin Jayashakira Maths AS - Level English 1 page

Content of the notes (1)

Page 1

Critical Path Analysis

Key Terms

Objective function- the maximising or minimising inequality that involves money e.g. profit, cost, revenue

Decision variables- numbers of each things that can be varied (variables), variable is the letter assigned to the inequality e.g. x, y

Constraint- the things that prevents an infinite number of each variable being made or used, each constraint limits one inequality

Feasible solutions- the values that satisfy each constraint

Feasible region- the region on a graph that includes all feasible solutions

Optimal solution- one solution that satisfies the objective function

Stages

1. Use the information given to create the objective function e.g. Sarah sells cupcakes at 50p and muffins at 80p, she wants to maximise her profits- maximise P= 0.50c + 0.80m (P is profit)

2. List all the inequalities (remember to simplify) and use a table to help you

3. Do a summary of the information you have- these three stages are called formulating the linear programming problem

4. Work out coordinates of inequalities and draw them on a graph, to work out do when x=0 y=?, when y=0, x=? but for equations like 2x=y where both equal 0, do when y=1, x=? etc

5. Shade in the unwanted regions, use test coordinates e.g. test (0,0) and if the answer satisfies inequality you shade in the other side

6. Label optimal region R, this region conatins all the optimal solutions that satisfy all inequalities

To work out optimal point from here, there are two methods:

1) Ruler Method- used for graphs that have one optimal point

2) Vertex Test Method- used for graphs with more than one vertex with optimal points

Ruler Method

Use objective function to produce a

formula triangle with x on the vertical side and y on the horizontal side

Draw objective function line and use

ruler to slide across (parallel to line) the optimal region

Minimising objectives are the first

point the ruler touches as it enters the region

Maximising objectives are the last

point the ruler touches as it exits the region

Information

Description
AS - Level Maths Note on Linear Programming, created by Erin Jayashakira on 06/01/2016.
Created by
Erin Jayashakira · Jan 2016
Updated
Apr 15, 2016
Views
9
Rating

More on Linear Programming

Feedback

What is it about?

What should we add next?