The problem. Needed for contract. 10% Reduction. Resources available

Size: px
Start display at page:

Download "The problem. Needed for contract. 10% Reduction. Resources available"

Transcription

1 As part of May 2010 s P2 paper, a question was asked (Q6) which required candidates to prepare a graph showing the optimum production plan for the organisation in question. In his post examination guide (PEG), available on the CIMA website, the examiner identified several deficiencies in the responses attempted by candidates. This article revisits that question and, in a detailed analysis of the answer, aims to inform future candidates of a better way of producing a high scoring answer. The problem Firstly, we need to remind ourselves of the initial problem via this extract from the full question (please refer to the May 2010 paper for the whole question): RT produces two products from different quantities of the same resources using a just-in-time (JIT) production system. The selling price and resource requirements of each of the products are shown below: Product R T Unit selling price ($) Resources per unit: Direct labour ($8 per hour) 3 hours 5 hours Material A ($3 per kg) 5 kgs 4 kgs Material B ($7 per litre) 2 litres 1 litre Machine hours ($10 per hour) 3 hours 4 hours Market research shows that the maximum demand for products R and T during June 2010 is 500 units and 800 units respectively. This does not include an order that RT has agreed with a commercial customer for the supply of 250 units of R and 350 units of T. At a recent meeting of the purchasing and production managers to discuss the production plans of RT for June, the following resource restrictions for June were identified: Direct labour hours Material A Material B Machine hours 7,500 hours 8,500 kgs 3,000 litres 7,500 hours It then becomes apparent that the predicted resource restrictions were rather optimistic and that their availability could be as much as 10% lower than their original predictions. When we look at the production which RT wishes to undertake, including the fulfilment of the contract, and compare it to the resources at its disposal, we can see that there is more than one scarce resource. Resource Initial quantity 10% Reduction Needed for contract Resources available Resources needed for maximum demand Direct labour 7, ,500 4,250 5,500 Material A 8, ,650 5,000 5,700 Material B 3, ,850 1,800 Machine hours 7, ,150 4,600 4,700 For illustration of this table, let s look at the direct labour hours. Originally it was thought that 7,500 labour hours would be available but now the forecast has been reduced by 10%. The contract requires the following hours: R 250 units x 3 hours = 750 hours T 350 units x 5 hours = 1,750 hours 2,500 hours

2 This leaves 7, ,500 = 4,250 hours available. Maximum demand requires (500 x 3) + (800 x 5) = 5,500 hours, hence the direct labour is a scarce resource. Similar calculations show that material A and machine hours are also scarce. Having more than one scarce resource means that we cannot solve the problem using contribution per unit of scarce resource and then ranking the products as we could in parts (a) and (b) of this question (this was also covered in my earlier Financial Management articles of November / December 2009 and March 2010). The examiner has told you this by telling you to use graphical linear programming to show the optimum production plan to answer part (c). Preparing the solution When preparing solutions to graphical linear programming problems, I recommend a five step approach. Step 1 Define the variables We must define the variables (letters) which we are going to use. For example: Let R be the number of units of product R to be produced in June Let T be the number of units of product T to be produced in June Step 2 Determine the objective function Next we need to determine the objective of the exercise and express it as an equation. RT wishes to maximise total contribution (TC) where TC = 47R + 61T You may wish to confirm for yourself that the variable cost of a unit of R is $83 and hence its contribution per unit is $(130 83) = $47. You can do the same for T. Step 3 Establish the constraints This is where we express the resource constraints in the form of inequalities. It sounds difficult, but if you get the first one they should be logical to follow. Looking at direct labour: Each unit of R takes 3 hours, each unit of T takes 5 hours and we know that only 4,250 hours available. Therefore the total usage of the labour hours must be less than (<) or equal (=) to the total labour hours available. We can show this as follows: 3R + 5T <= 4,250 (labour hours) The same logic can then be applied to the other three resource constraints: 5R + 4T <= 5,000 (Material A) 2R + 1T <= 1,850 (Material B) 3R + 4T <= 4,600 (Machine hours)

3 That s the resource constraints dealt with, but let s not forget that there are two other restrictions on the values that R and T can take. Since we are using a just-in-time production system, we will not produce any more units than we are selling. Therefore, there is an upper limit of 500 units on the production of R, and 800 units for T. i.e. R <= 500 (production) T <= 800 (production) More precisely, we should also define the lower limit to the values for R and T, which in this scenario is zero: 0 <= R <= <= T <= 800 Taking all of this together, we have now defined our problem which is that we wish to maximise contribution TC = 47R + 61T subject to the following (numbered) constraints 3R + 5T <= 4, R + 4T <= 5, R + 1T <= 1, R + 4T <= 4, <= R <= <= T <= Step 4 Graph the constraints (by converting them into straight line equations) This seems to be the most difficult area for students and was where many candidates let themselves down in the examination. Regarding May 2010 s candidates answers, the examiner said in the PEG, many candidates earned only half the available marks due to a number of issues including poorly constructed graphs, presenting only an inaccurate sketch graph and not putting forward a final answer...many graphs were poorly constructed; the lines and the axes were not labelled and the graphs were very untidy. Clearly, this needs some attention. In order to draw the graph, you need to accurately plot each of the inequalities expressed above as straight line equations. So, for example, constraint 1 becomes: 3R + 5T = 4,250 To plot this line, you need only 2 points. I recommend plotting the two extreme points in this manner: Putting R = 0, then the equation simplifies to 5T = 4,250 And T = 850. Similarly, putting instead T = 0, the equation simplifies to 3R = 4,250 And R = 1,

4 This not only gives us two points on the graph, and hence the first constraint line, but it gives us the first indication of the scale needed for the graph. Too many students in my experience produce graphs that are either too large in that the constraint lines cannot be shown on the page or alternatively too small such that they are squashed postage stamp sized in the corner of the page. The figures for constraint 1 suggest that a scale of around 1 centimetre for 100 units may suffice (performing similar calculations on other constraints may confirm this). Graph 1 showing labelled scaled axes (as per examiners answer)

5 Plotting the figures for constraint 1 gives us the following two points: Graph 2 showing two points of the first constraint

6 And hence the two points can be joined to form the first constraint line, which should then be labelled. Graph 3 showing the first constraint

7 Moving onto constraint 2 for material A which becomes: 5R + 4T = 5,000 Find the 2 points: Putting R = 0, then the equation simplifies to 4T = 5,000 And T = 1,250. Similarly, putting instead T = 0, the equation simplifies to 5R = 5,000 And R = 1,000. Now we have the second constraint line on the diagram (and confirmation that our scale seems appropriate tip, do all of these workings first and know the maximum figure for both R and T) Graph 4 showing the second constraint

8 If we repeat this exercise for the other two resource equations and the two (simpler) demand equations, then we get the fuller picture regarding the constraints. Graph 5 showing all 6 constraints and feasible area OABCD These lines represent the maximum possible use of each of these constraints. They form a boundary beyond which production cannot take place. In fact, production can only take place in the area formed by points OABCD. This is called the Feasible Region and should be labelled on your graph. Step 5 Determine the optimum solution Before stepping into the intricacies of finding the optimum point, a little common sense can simplify matters. Point B must be a better outcome than point A. At A, units of R are 0, whilst units of T are 800. At point B, we have the same 800 units of T, but clearly some units of R, and therefore the total contribution at point B must be bigger than it is at point A. Similarly, point C is bound to be a better outcome than point D. At D, units of T are 0, whilst units of R are 500. At point D, we have the same 500 units of R, but over 500 units of T. This logic points to the optimum solution being either at B or C or even at both and at all points in between. This is where a good, accurate graph is really beneficial, as you can simply read off the coordinates of points B and C. Point B has T = 800 and R = (provable mathematically by placing T = 800 into the labour constraint: 3R + (5 x 800) = 4,250 3R = 250 R = 83.33)

9 Point C has R = 500 and T = 550. (provable mathematically by placing R = 500 into the labour constraint: (3 x 500) + 5T = 4,250 5T = 2,750 T = 550) The total contribution we can earn at each point will tell us which is better, B or C, and we do this by using the objective function established in Step 2. At B, Total contribution = (47 x 83.33) + (61 x 800) = 52, At C, Total contribution = (47 x 500) + (61 x 550) = 57,050. Therefore, the optimum point is C with production of 500 units of R and 550 units of T yielding a total contribution of $57,050. The textbook way of arriving at the optimum point is to use what is known as the Iso-contribution function referred to in the examiners answer. With this, we plot the objective function Total contribution = 47R + 61T, which reflects the relative unit contributions of the products namely $47 for a unit of R, $61 for a unit of T. In order to do this, we can take any value for total contribution. Students often find it baffling that we can seemingly invent a value for total contribution, but the point is that the line will move anyway as we seek to find the best possible point of production. My tip here is to select a value for total contribution which is a multiple of the individual contributions i.e. 47 x 61 = $2,867 so that it makes it easy to plot your line. This seems a little low in the context of the question, so I shall scale it up by 10 to $28,670. Therefore, we want to plot the line for: 28,670 = 47R + 61T.

10 Once again, Putting R = 0, then the equation simplifies to 28,670 = 61T 470 = T Similarly, putting instead T = 0, the equation simplifies to 28,670 = 47R 610 = R Adding this to our graph gives us Graph 6 showing all 6 constraints plus dotted Iso-contribution line as per examiners answer

11 If you place your ruler along this line and slide it outwards, but keeping it parallel to the initial line (this represents what would happen when output is increased: the line would move outwards), you should be able to see the furthest possible point which can be reached while keeping part of it within the feasible region is point C. This is therefore the optimum point as we proved by inspection earlier. Summary Graph 7 showing all 6 constraints lines plus the new Iso-contribution line, parallel to the original one, but going through C In summary, once the problem has been formulated as in steps 1 to 3 above, you need to: Draw on a graph two axes to represent the two decision variables, R and T in this case Plot all of the constraints of the model as straight lines by evaluating where the limiting equations intersect the axes. Identify the area on the graph (known as the feasible region) that satisfies all of the constraints. Find the optimum point. If the problem is one of maximisation, as in this case, then the values of the decision variables, R and T, computed above either by inspection or graphically, that yields the largest figure for the objective function (Total contribution), constitute the combination which makes best use of the scarce resources. Ian Janes is CIMA Course Leader at Newport Business School, where his colleague Rosemary Eaton assisted in the technical production of the graphs.

12 Question for students (answer to be given in the April 2011 edition of Velocity) The final part of the question in the May 2010 examination, part (d), asked candidates to consider how the graph in your solution to (c) above can be used to help to determine the optimum production plan for June 2010 if the actual resource availability lies somewhere between the managers optimistic and pessimistic predictions If we isolate the effect of having more direct labour hours available, chosen since this is the binding resource constraint, then we can see from graph 7 that an expansion of hours will mean an outward movement of that line and hence point C will also move. This will bring about increased production of units of T, with units of R remaining the same. This will mean more total contribution. With this in mind: (a) Calculate the shadow price of direct labour. (b) Assuming that it is just more direct labour hours which become available, and there s no further availability of the other three scarce resources, state the upper limit of units and hours over which the shadow price in (a) remains the same, and state (and explain) the shadow price of labour beyond that limit

UNIT 6 MODELLING DECISION PROBLEMS (LP)

UNIT 6 MODELLING DECISION PROBLEMS (LP) UNIT 6 MODELLING DECISION This unit: PROBLEMS (LP) Introduces the linear programming (LP) technique to solve decision problems 1 INTRODUCTION TO LINEAR PROGRAMMING A Linear Programming model seeks to maximize

More information

LINEAR PROGRAMMING. Chapter Overview

LINEAR PROGRAMMING. Chapter Overview Chapter 12 LINEAR PROGRAMMING 12.1 Overview 12.1.1 An Optimisation Problem A problem which seeks to maximise or minimise a function is called an optimisation problem. An optimisation problem may involve

More information

Econ 172A - Slides from Lecture 2

Econ 172A - Slides from Lecture 2 Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.

More information

Chapter 3 Linear Programming: A Geometric Approach

Chapter 3 Linear Programming: A Geometric Approach Chapter 3 Linear Programming: A Geometric Approach Section 3.1 Graphing Systems of Linear Inequalities in Two Variables y 4x + 3y = 12 4 3 4 x 3 y 12 x y 0 x y = 0 2 1 P(, ) 12 12 7 7 1 1 2 3 x We ve seen

More information

a) Alternative Optima, b) Infeasible(or non existing) solution, c) unbounded solution.

a) Alternative Optima, b) Infeasible(or non existing) solution, c) unbounded solution. Unit 1 Lesson 5. : Special cases of LPP Learning Outcomes Special cases of linear programming problems Alternative Optima Infeasible Solution Unboundedness In the previous lecture we have discussed some

More information

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016 Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)

More information

Box It Up (A Graphical Look)

Box It Up (A Graphical Look) . Name Date A c t i v i t y 1 0 Box It Up (A Graphical Look) The Problem Ms. Hawkins, the physical sciences teacher at Hinthe Middle School, needs several open-topped boxes for storing laboratory materials.

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :

More information

CHAPTER 12: LINEAR PROGRAMMING

CHAPTER 12: LINEAR PROGRAMMING CHAPTER 12: LINEAR PROGRAMMING Previous Years Board Exam (Important Questions & Answers) MARKS WEIGHTAGE 06 marks 1. A cottage industry manufactures pedestal lamps and wooden shades, each requiring the

More information

SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM

SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM ADVANCED MANAGEMENT ACCOUNTING Test Code - F M J 4 0 1 6 BRANCH - (MULTIPLE) (Date : 11.02.2017) Head Office : Shraddha, 3 rd Floor, Near Chinai College, Andheri

More information

Graphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved.

Graphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved. Graphical Analysis For problems with 2 variables, we can represent each solution as a point in the plane. The Shelby Shelving model (see the readings book or pp.68-69 of the text) is repeated below for

More information

UNIT 2 LINEAR PROGRAMMING PROBLEMS

UNIT 2 LINEAR PROGRAMMING PROBLEMS UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5

More information

ax + by = 0. x = c. y = d.

ax + by = 0. x = c. y = d. Review of Lines: Section.: Linear Inequalities in Two Variables The equation of a line is given by: ax + by = c. for some given numbers a, b and c. For example x + y = 6 gives the equation of a line. A

More information

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved. 3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.1 Graphing Systems of Linear Inequalities in Two Variables Copyright Cengage Learning. All rights reserved.

More information

Meeting 1 Introduction to Functions. Part 1 Graphing Points on a Plane (REVIEW) Part 2 What is a function?

Meeting 1 Introduction to Functions. Part 1 Graphing Points on a Plane (REVIEW) Part 2 What is a function? Meeting 1 Introduction to Functions Part 1 Graphing Points on a Plane (REVIEW) A plane is a flat, two-dimensional surface. We describe particular locations, or points, on a plane relative to two number

More information

Chapter 1. Linear Equations and Straight Lines. 2 of 71. Copyright 2014, 2010, 2007 Pearson Education, Inc.

Chapter 1. Linear Equations and Straight Lines. 2 of 71. Copyright 2014, 2010, 2007 Pearson Education, Inc. Chapter 1 Linear Equations and Straight Lines 2 of 71 Outline 1.1 Coordinate Systems and Graphs 1.4 The Slope of a Straight Line 1.3 The Intersection Point of a Pair of Lines 1.2 Linear Inequalities 1.5

More information

( ) ( 200, 0 ) and 0, 200. Linear programming 6C. ( 40, 0) and ( 0, 80) ( 100.8,16.8) F = 168. ( 37.5, 22.5) m=97.5. Objective line passes through

( ) ( 200, 0 ) and 0, 200. Linear programming 6C. ( 40, 0) and ( 0, 80) ( 100.8,16.8) F = 168. ( 37.5, 22.5) m=97.5. Objective line passes through Linear programming 6C 1 a Need intersection of 4x+y= 1400 and 3x+2y= 1200 ( 320,120) m=760 b ( 0, 400) N = 1600 c Need intersection of x+ 3y= 1200 and 3x+2y= 1200 ( 171 3, 342 6) 7 7 P= 514 2 7 d ( 350,

More information

Real life Problem. Review

Real life Problem. Review Linear Programming The Modelling Cycle in Decision Maths Accept solution Real life Problem Yes No Review Make simplifying assumptions Compare the solution with reality is it realistic? Interpret the solution

More information

Equations of planes in

Equations of planes in Roberto s Notes on Linear Algebra Chapter 6: Lines, planes and other straight objects Section Equations of planes in What you need to know already: What vectors and vector operations are. What linear systems

More information

In other words, we want to find the domain points that yield the maximum or minimum values (extrema) of the function.

In other words, we want to find the domain points that yield the maximum or minimum values (extrema) of the function. 1 The Lagrange multipliers is a mathematical method for performing constrained optimization of differentiable functions. Recall unconstrained optimization of differentiable functions, in which we want

More information

LP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008

LP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008 LP-Modelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following

More information

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D. Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method

More information

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras. Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide

More information

QUADRATIC AND CUBIC GRAPHS

QUADRATIC AND CUBIC GRAPHS NAME SCHOOL INDEX NUMBER DATE QUADRATIC AND CUBIC GRAPHS KCSE 1989 2012 Form 3 Mathematics Working Space 1. 1989 Q22 P1 (a) Using the grid provided below draw the graph of y = -2x 2 + x + 8 for values

More information

LINEAR PROGRAMMING INTRODUCTION 12.1 LINEAR PROGRAMMING. Three Classical Linear Programming Problems (L.P.P.)

LINEAR PROGRAMMING INTRODUCTION 12.1 LINEAR PROGRAMMING. Three Classical Linear Programming Problems (L.P.P.) LINEAR PROGRAMMING 12 INTRODUCTION ou are familiar with linear equations and linear inequations in one and two variables. They can be solved algebraically or graphically (by drawing a line diagram in case

More information

Chapter 4. Linear Programming

Chapter 4. Linear Programming Chapter 4 Linear Programming For All Practical Purposes: Effective Teaching Occasionally during the semester remind students about your office hours. Some students can perceive that they are bothering

More information

Mathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11)

Mathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11) Mathematics for Business and Economics - I Chapter7 Linear Inequality Systems and Linear Programming (Lecture11) A linear inequality in two variables is an inequality that can be written in the form Ax

More information

Note that ALL of these points are Intercepts(along an axis), something you should see often in later work.

Note that ALL of these points are Intercepts(along an axis), something you should see often in later work. SECTION 1.1: Plotting Coordinate Points on the X-Y Graph This should be a review subject, as it was covered in the prerequisite coursework. But as a reminder, and for practice, plot each of the following

More information

Second Edition. Concept Builders. Jana Kohout

Second Edition. Concept Builders. Jana Kohout Second Edition Concept Builders Jana Kohout First published in Australia as an online resource in 016. Edited and printed in 017. Jana Kohout 017 Reproduction and Communication for educational purposes

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Question 2: How do you solve a linear programming problem with a graph?

Question 2: How do you solve a linear programming problem with a graph? Question : How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.

More information

OPERATIONS RESEARCH. Linear Programming Problem

OPERATIONS RESEARCH. Linear Programming Problem OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com 1.0 Introduction Linear programming

More information

MA30SA Applied Math Unit D - Linear Programming Revd:

MA30SA Applied Math Unit D - Linear Programming Revd: 1 Introduction to Linear Programming MA30SA Applied Math Unit D - Linear Programming Revd: 120051212 1. Linear programming is a very important skill. It is a brilliant method for establishing optimum solutions

More information

CHAPTER 12: LINEAR PROGRAMMING

CHAPTER 12: LINEAR PROGRAMMING CHAPTER 12: LINEAR PROGRAMMING MARKS WEIGHTAGE 06 marks NCERT Important Questions & Answers 1. Determine graphically the minimum value of the objective function Z = 50x + 20y subject to the constraints:

More information

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below.

Intro to Linear Programming. The problem that we desire to address in this course is loosely stated below. . Introduction Intro to Linear Programming The problem that we desire to address in this course is loosely stated below. Given a number of generators make price-quantity offers to sell (each provides their

More information

Preparing for AS Level Further Mathematics

Preparing for AS Level Further Mathematics Preparing for AS Level Further Mathematics Algebraic skills are incredibly important in the study of further mathematics at AS and A level. You should therefore make sure you are confident with all of

More information

Linear Functions. Connection to AP*: AP Calculus Topic: Analysis of Functions

Linear Functions. Connection to AP*: AP Calculus Topic: Analysis of Functions Connecting Middle Grades to Advanced Placement* Mathematics A Resource and Strategy Guide Linear Functions Objective: Students will write an equation for a given problem situation and investigate the relationships

More information

The angle measure at for example the vertex A is denoted by m A, or m BAC.

The angle measure at for example the vertex A is denoted by m A, or m BAC. MT 200 ourse notes on Geometry 5 2. Triangles and congruence of triangles 2.1. asic measurements. Three distinct lines, a, b and c, no two of which are parallel, form a triangle. That is, they divide the

More information

Introduction to Linear Programing Problems

Introduction to Linear Programing Problems Paper: Linear Programming and Theory of Games Lesson: Introduction to Linear Programing Problems Lesson Developers: DR. MANOJ KUMAR VARSHNEY, College/Department: Department of Statistics, Hindu College,

More information

Lesson 18: There is Only One Line Passing Through a Given Point with a Given

Lesson 18: There is Only One Line Passing Through a Given Point with a Given Lesson 18: There is Only One Line Passing Through a Given Point with a Given Student Outcomes Students graph equations in the form of using information about slope and intercept. Students know that if

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,

More information

Mathematics. Linear Programming

Mathematics. Linear Programming Mathematics Linear Programming Table of Content 1. Linear inequations. 2. Terms of Linear Programming. 3. Mathematical formulation of a linear programming problem. 4. Graphical solution of two variable

More information

Chapter 4 Linear Programming

Chapter 4 Linear Programming Chapter Objectives Check off these skills when you feel that you have mastered them. From its associated chart, write the constraints of a linear programming problem as linear inequalities. List two implied

More information

Linear Programming. ICM Unit 3 Day 1 Part 1

Linear Programming. ICM Unit 3 Day 1 Part 1 Linear Programming ICM Unit 3 Day 1 Part 1 Arrival: Tools of the Trade Pencils Grab a couple to SHARE with your partner. Graph Paper Two pieces per student for today. Ruler One per student. Get out a NEW

More information

A Real Life Application of Linear Programming

A Real Life Application of Linear Programming Dagon University Research Journal 2012, Vol. 4 A Real Life Application of Linear Programming Win Win Myo * Abstract Linear programming is heavily used in microeconomics and company management, such as

More information

Lesson 08 Linear Programming

Lesson 08 Linear Programming Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications

More information

Linear Modeling Elementary Education 4

Linear Modeling Elementary Education 4 Linear Modeling Elementary Education 4 Mathematical modeling is simply the act of building a model (usually in the form of graphs) which provides a picture of a numerical situation. Linear Modeling is

More information

Reasoning and writing about algorithms: some tips

Reasoning and writing about algorithms: some tips Reasoning and writing about algorithms: some tips Theory of Algorithms Winter 2016, U. Chicago Notes by A. Drucker The suggestions below address common issues arising in student homework submissions. Absorbing

More information

Section 3.1 Graphing Using the Rectangular Coordinate System

Section 3.1 Graphing Using the Rectangular Coordinate System Objectives Section 3.1 Graphing Using the Rectangular Coordinate System n Construct a rectangular coordinate system n Plot ordered pairs and determine the coordinates of a point n Graph paired data n Read

More information

Some Advanced Topics in Linear Programming

Some Advanced Topics in Linear Programming Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,

More information

NARROW CORRIDOR. Teacher s Guide Getting Started. Lay Chin Tan Singapore

NARROW CORRIDOR. Teacher s Guide Getting Started. Lay Chin Tan Singapore Teacher s Guide Getting Started Lay Chin Tan Singapore Purpose In this two-day lesson, students are asked to determine whether large, long, and bulky objects fit around the corner of a narrow corridor.

More information

Section 7.3 from Basic Mathematics Review by Oka Kurniawan was developed by OpenStax College, licensed by Rice University, and is available on the

Section 7.3 from Basic Mathematics Review by Oka Kurniawan was developed by OpenStax College, licensed by Rice University, and is available on the Section 7.3 from Basic Mathematics Review by Oka Kurniawan was developed by OpenStax College, licensed by Rice University, and is available on the Connexions website. It is used under a Creative Commons

More information

LINEAR PROGRAMMING (LP), GRAPHICAL PRESENTATION GASPAR ASAMPANA

LINEAR PROGRAMMING (LP), GRAPHICAL PRESENTATION GASPAR ASAMPANA LINEAR PROGRAMMING (LP), GRAPHICAL PRESENTATION GASPAR ASAMPANA INTRODUCTION Linear Programming a is combination of a linear objective function and set of linear constraints. The linear constraints express

More information

Lecture 5: Duality Theory

Lecture 5: Duality Theory Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane

More information

Section 1.2: Points and Lines

Section 1.2: Points and Lines Section 1.2: Points and Lines Objective: Graph points and lines using x and y coordinates. Often, to get an idea of the behavior of an equation we will make a picture that represents the solutions to the

More information

Systems of Equations and Inequalities. Copyright Cengage Learning. All rights reserved.

Systems of Equations and Inequalities. Copyright Cengage Learning. All rights reserved. 5 Systems of Equations and Inequalities Copyright Cengage Learning. All rights reserved. 5.5 Systems of Inequalities Copyright Cengage Learning. All rights reserved. Objectives Graphing an Inequality Systems

More information

Graphical Analysis of Data using Microsoft Excel [2016 Version]

Graphical Analysis of Data using Microsoft Excel [2016 Version] Graphical Analysis of Data using Microsoft Excel [2016 Version] Introduction In several upcoming labs, a primary goal will be to determine the mathematical relationship between two variable physical parameters.

More information

Thursday 24 May 2012 Morning

Thursday 24 May 2012 Morning Thursday 24 May 2012 Morning AS GCE MATHEMATICS 4736 Decision Mathematics 1 QUESTION PAPER *4715580612* Candidates answer on the Printed Answer Book. OCR supplied materials: Printed Answer Book 4736 List

More information

CURVE SKETCHING EXAM QUESTIONS

CURVE SKETCHING EXAM QUESTIONS CURVE SKETCHING EXAM QUESTIONS Question 1 (**) a) Express f ( x ) in the form ( ) 2 f x = x + 6x + 10, x R. f ( x) = ( x + a) 2 + b, where a and b are integers. b) Describe geometrically the transformations

More information

Direct Variations DIRECT AND INVERSE VARIATIONS 19. Name

Direct Variations DIRECT AND INVERSE VARIATIONS 19. Name DIRECT AND INVERSE VARIATIONS 19 Direct Variations Name Of the many relationships that two variables can have, one category is called a direct variation. Use the description and example of direct variation

More information

Graphical Methods in Linear Programming

Graphical Methods in Linear Programming Appendix 2 Graphical Methods in Linear Programming We can use graphical methods to solve linear optimization problems involving two variables. When there are two variables in the problem, we can refer

More information

Year 10 Term 2 Homework

Year 10 Term 2 Homework Yimin Math Centre Year 10 Term 2 Homework Student Name: Grade: Date: Score: Table of contents 5 Year 10 Term 2 Week 5 Homework 1 5.1 Graphs in the number plane................................ 1 5.1.1 The

More information

Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable *

Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable * OpenStax-CNX module: m18877 1 Graphing Linear Equations and Inequalities: Graphing Linear Equations and Inequalities in One Variable * Wade Ellis Denny Burzynski This work is produced by OpenStax-CNX and

More information

Introduction to Functions of Several Variables

Introduction to Functions of Several Variables Introduction to Functions of Several Variables Philippe B. Laval KSU Today Philippe B. Laval (KSU) Functions of Several Variables Today 1 / 20 Introduction In this section, we extend the definition of

More information

Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3

Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 In this case let s say delta B and delta C are the kinematically consistent displacements.

More information

The notion of functions

The notion of functions Chapter 1 The notion of functions Textbook Chapter 1 1.1 The concept of functions Although the concept of functions was invented a very long time ago, it is very easy today to gain an intuitive notion

More information

II. Linear Programming

II. Linear Programming II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative

More information

Section 18-1: Graphical Representation of Linear Equations and Functions

Section 18-1: Graphical Representation of Linear Equations and Functions Section 18-1: Graphical Representation of Linear Equations and Functions Prepare a table of solutions and locate the solutions on a coordinate system: f(x) = 2x 5 Learning Outcome 2 Write x + 3 = 5 as

More information

The Game of Criss-Cross

The Game of Criss-Cross Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that

More information

Section 8.3 Vector, Parametric, and Symmetric Equations of a Line in

Section 8.3 Vector, Parametric, and Symmetric Equations of a Line in Section 8.3 Vector, Parametric, and Symmetric Equations of a Line in R 3 In Section 8.1, we discussed vector and parametric equations of a line in. In this section, we will continue our discussion, but,

More information

1) Complete problems 1-65 on pages You are encouraged to use the space provided.

1) Complete problems 1-65 on pages You are encouraged to use the space provided. Dear Accelerated Pre-Calculus Student (017-018), I am excited to have you enrolled in our class for next year! We will learn a lot of material and do so in a fairly short amount of time. This class will

More information

Chapter 12: Quadratic and Cubic Graphs

Chapter 12: Quadratic and Cubic Graphs Chapter 12: Quadratic and Cubic Graphs Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2y 2 + 9y + 2 All the above equations contain a squared number. They are therefore called quadratic

More information

Guidance to support the DWP 2 Tier Complaints Resolution Process

Guidance to support the DWP 2 Tier Complaints Resolution Process Guidance to support the DWP 2 Tier Complaints Resolution Process Purpose This guidance is for all DWP staff that are following the 2 tier complaints resolution process, except those working in a Contact

More information

LINEAR PROGRAMMING. City of London Academy 1

LINEAR PROGRAMMING. City of London Academy 1 LINEAR PROGRAMMING City of London Academy 1 1. The captain of the Malde Mare takes passengers on trips across the lake in her boat. The number of children is represented by x and the number of adults by

More information

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters..

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters.. Chapter 1 Points, Lines & Planes s we begin any new topic, we have to familiarize ourselves with the language and notation to be successful. My guess that you might already be pretty familiar with many

More information

Lesson 21: Solution Sets to Inequalities with Two Variables

Lesson 21: Solution Sets to Inequalities with Two Variables Student Outcomes Students recognize and identify solutions to two variable inequalities. They represent the solution set graphically. They create two variable inequalities to represent a situation. Students

More information

Edexcel GCSE ICT. Controlled Assessment. Teacher Support Book 2012

Edexcel GCSE ICT. Controlled Assessment. Teacher Support Book 2012 Edexcel GCSE ICT Controlled Assessment Teacher Support Book 2012 Edexcel GCSE ICT Controlled Assessment Teacher Support Book Unit 2: Using Digital Tools Unit 4: Creating Digital Products Welcome to the

More information

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS Linear programming is a mathematical technique for finding optimal solutions to problems that can be expressed using linear equations and inequalities. If a real-world problem can be represented accurately

More information

Rational Number Operations on the Number Line

Rational Number Operations on the Number Line The Mathematics Enthusiast Volume 14 Number 1 Numbers 1, 2, & 3 Article 18 1-2017 Rational Number Operations on the Number Line Christopher Yakes Let us know how access to this document benefits you. Follow

More information

An introduction to interpolation and splines

An introduction to interpolation and splines An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve

More information

Using Excel for Graphical Analysis of Data

Using Excel for Graphical Analysis of Data Using Excel for Graphical Analysis of Data Introduction In several upcoming labs, a primary goal will be to determine the mathematical relationship between two variable physical parameters. Graphs are

More information

Math 21a Homework 22 Solutions Spring, 2014

Math 21a Homework 22 Solutions Spring, 2014 Math 1a Homework Solutions Spring, 014 1. Based on Stewart 11.8 #6 ) Consider the function fx, y) = e xy, and the constraint x 3 + y 3 = 16. a) Use Lagrange multipliers to find the coordinates x, y) of

More information

An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis October 12, 2016 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

More information

Linear Programming. L.W. Dasanayake Department of Economics University of Kelaniya

Linear Programming. L.W. Dasanayake Department of Economics University of Kelaniya Linear Programming L.W. Dasanayake Department of Economics University of Kelaniya Linear programming (LP) LP is one of Management Science techniques that can be used to solve resource allocation problem

More information

Applications of Linear Programming

Applications of Linear Programming Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 1 Why LP? Linear programming (LP, also called linear

More information

Graphing with a Graphing Calculator

Graphing with a Graphing Calculator APPENDIX C Graphing with a Graphing Calculator A graphing calculator is a powerful tool for graphing equations and functions. In this appendix we give general guidelines to follow and common pitfalls to

More information

(Refer Slide Time: 00:02:02)

(Refer Slide Time: 00:02:02) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 20 Clipping: Lines and Polygons Hello and welcome everybody to the lecture

More information

LINEAR PROGRAMMING. Chapter Introduction

LINEAR PROGRAMMING. Chapter Introduction 504 MATHEMATICS Chapter 12 LINEAR PROGRAMMING The mathematical experience of the student is incomplete if he never had the opportunity to solve a problem invented by himself. G. POLYA 12.1 Introduction

More information

Graphs of Exponential

Graphs of Exponential Graphs of Exponential Functions By: OpenStaxCollege As we discussed in the previous section, exponential functions are used for many realworld applications such as finance, forensics, computer science,

More information

5. Lecture notes on matroid intersection

5. Lecture notes on matroid intersection Massachusetts Institute of Technology Handout 14 18.433: Combinatorial Optimization April 1st, 2009 Michel X. Goemans 5. Lecture notes on matroid intersection One nice feature about matroids is that a

More information

(Refer Slide Time: 06:01)

(Refer Slide Time: 06:01) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 28 Applications of DFS Today we are going to be talking about

More information

Topic. Section 4.1 (3, 4)

Topic. Section 4.1 (3, 4) Topic.. California Standards: 6.0: Students graph a linear equation and compute the x- and y-intercepts (e.g., graph x + 6y = ). They are also able to sketch the region defined by linear inequality (e.g.,

More information

In this activity, students will graph the relationship between the length of the sides of cut-out squares and the volume of the resulting box.

In this activity, students will graph the relationship between the length of the sides of cut-out squares and the volume of the resulting box. Box It Up (A Graphical Approach) ID: 4647 Time required 45 minutes Activity Overview In this activity, students will graph the relationship between the length of the sides of cut-out squares and the volume

More information

Section Graphs of the Sine and Cosine Functions

Section Graphs of the Sine and Cosine Functions Section 5. - Graphs of the Sine and Cosine Functions In this section, we will graph the basic sine function and the basic cosine function and then graph other sine and cosine functions using transformations.

More information

Plotting Graphs. Error Bars

Plotting Graphs. Error Bars E Plotting Graphs Construct your graphs in Excel using the method outlined in the Graphing and Error Analysis lab (in the Phys 124/144/130 laboratory manual). Always choose the x-y scatter plot. Number

More information

Haga's Origamics. Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding.

Haga's Origamics. Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding. Haga's Origamics Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding. Activity I : TUPS (Turned-Up Parts) Take a square piece of paper and label the

More information

boxplot - A graphic way of showing a summary of data using the median, quartiles, and extremes of the data.

boxplot - A graphic way of showing a summary of data using the median, quartiles, and extremes of the data. Learning Target Create scatterplots and identify whether there is a relationship between two sets of data. Draw a line of best fit and use it to make predictions. Focus Questions How can I organize data?

More information

ELGIN ACADEMY Mathematics Department Evaluation Booklet (Core) Name Reg

ELGIN ACADEMY Mathematics Department Evaluation Booklet (Core) Name Reg ELGIN ACADEMY Mathematics Department Evaluation Booklet (Core) Name Reg CfEL You should be able to use this evaluation booklet to help chart your progress in the Maths department throughout S1 and S2.

More information

3.1. 3x 4y = 12 3(0) 4y = 12. 3x 4y = 12 3x 4(0) = y = x 0 = 12. 4y = 12 y = 3. 3x = 12 x = 4. The Rectangular Coordinate System

3.1. 3x 4y = 12 3(0) 4y = 12. 3x 4y = 12 3x 4(0) = y = x 0 = 12. 4y = 12 y = 3. 3x = 12 x = 4. The Rectangular Coordinate System 3. The Rectangular Coordinate System Interpret a line graph. Objectives Interpret a line graph. Plot ordered pairs. 3 Find ordered pairs that satisfy a given equation. 4 Graph lines. 5 Find x- and y-intercepts.

More information