Graphing Linear Inequalities in Two Variables.
|
|
- Stephany Dalton
- 6 years ago
- Views:
Transcription
1 Many applications of mathematics involve systems of inequalities rather than systems of equations. We will discuss solving (graphing) a single linear inequality in two variables and a system of linear inequalities in two variables. Graphing Linear Inequalities in Two Variables. Terminology. A line divides the plane into two regions called half-planes. A vertical line divides the plane into left half-plane and right half-plane. A non-vertical line divides the plane into upper half-plane and lower half-plane. In either case, the dividing line is called the boundary line of each half-plane. Problem #. Make sketch of the following line and label half-planes. a) x = 3 b) y = 5 c) y = 3x 4 d) y = x + 3
2 Problem #. Graph the following inequality. a) y > 5 b) y 5 c) y < 5 d) y 5
3 e) x 4y f ) 3x y g) 3x+ y 5 h) x y > 3 3
4 Solving Systems of Linear Inequalities (graphically). Terminology. To solve a System of Linear Inequalities means to find the xy, that graph of all ordered pairs of real numbers ( ) simultaneously satisfy all the inequalities in the system. The graph is called the solution region for the system, or feasible region. Problem #3. Solve the following system of linear inequalities graphically. 3x + y 4 x y 4
5 Problem #4. Solve the following system of line inequalities graphically. 3x+ y 4 0.5x+ y x+ y 5 x 0 y 0 y = 3x + 4 y = 0.5x + y = x + 5 Small shaded triangle is the feasible region for the system of inequalities. P P 5
6 Corner points. A corner point of a solution region is a point in the solution region that is the intersection of two boundary lines. Problem #5. Find coordinates of corner points for solution region in Problem #4. Corner points of the feasible region are P ( ) 0, - y-intercept of the line 0.5x+ y=, 6 0 P, - point of intersection of the lines 7 7 3x + y = 4.5x+ y= P 3 (0, 4) - y intercept of the line 3x+ y = 4 Bounded and Unbounded Solution Region. A solution region of a system of linear inequalities is bounded if it can be enclosed within a circle. If it cannot be enclosed within a circle, it is unbounded. 6
7 Applications. Resource allocation. Problem #6. A manufacturing plant makes two types of inflatable boats, a two-person boat and a four-person boat. Each two-person boat requires 0.9 labor-hour of the cutting department and 0.8 labor-hour in the assembly department. Each four-person boat requires.8 labor-hours of the cutting department and. labor-hours in the assembly department. The maximum labor-hours available each month in the cutting and assembly departments are 864 and 67 respectively. If x two-person boats and y four-person boats are manufactured each month, write a system of linear inequalities that reflect the conditions indicated. Find the feasible set graphically. 0.9x +.8y 864 x 0 0.8x+.y 67 y 0 7
8 Linear programming is a mathematical process that has been developed to help management in decision making. We will continue work with the Problem #6. Conditions of the manufacturing are translated into the following system of linear inequalities. Variables x and y were changed to and x. x 0.9x+.8x x+.x 67 x 0 x 0 Feasible region for this system is shown on the right. Additional INFO. The company makes a profit of $5 on each two-person boat and $40 on each four-person boat. Q uestion: How many boats of each type should be manufactured each month to maximize the total monthly profit, assuming that all boats can be sold? 8
9 The objective of management is to maximize profit. Since the profits for two-person boat and four-person boat differ, management must decide how many of each type of boat to manufacture. x = number of two-person boats and x = number of two-person boats are called decision variables. We can form the objective function P = 5x + 40x The objective is to find values of the decision variables that pr oduce the optimal value (in this case, maximum value) of the objective function. Following inequalities are problem constrains. 0.9x +.8x x +.x 67 Nonnegative constrains are x 0 x 0 9
10 Mathematical formulation of the problem. Maximize P = 5x + 40x (objective function) subject to 0.9x +.8x x +.x 67 x 0 x 0 Problem constraints Nonnegative constraints By choosing a production schedule x, x from the ( ) feasible region, a profit can be determined using the objective function P = 5x + 40x For example, if x = 00 and x = 300 the monthly profit would be ( ) ( ) P = = $7,000 If x = 00 and x = 400 the monthly profit would be ( ) ( ) P = = $8,500 0
11 But the question is, out of all possible production schedules x, x from the feasible region, which schedule(s) ( ) produces the maximum profit? We have a maximization problem. Point-by-point checking is not possible. Fundamental Theorem of Linear Programming. If the optimal value of the objective function in a linear programming problem exists, then the value must occur at one (or more) of the corner points of feasible region. Existence of Optimal Solutions.. If the feasible region for a linear programming problem is bounded, then both the maximum value and minimum value of the objective function always exist.. If the feasible region is unbounded and the coefficients of the objective function are positive, then the minimum value of the objective function exists, but the maximum value does not. 3. If the feasible region is empty, then both the maximum value and minimum value of the objective function do not exist.
12 Problem of boats manufacturing (finish). Feasible region is bounded. Solution of the optimization problem exists. C Corner points of the feasible region. C To find corner points we need work with equations of boundary lines. 0.9x+.8x = x +.x = 67 ( ) ( 0, 0 ) C : 0, 480 is the intersection of the line 0.9x+.8x = 864 with the vertical axis x = 0. C 3 C : ( 480, 40 ) is the intersection of two straight lines, solution of the system of two equations. ( ) : 840, 0 3 is the intersection of the line 0.8x +.x = 67 with the horizontal axis x = 0. C
13 x x P = 5( x ) + 40( x ) , , ,000 Answer. Schedule production that maximizes profit: 480 two-person boats and 40 four-person boats per month. Maximum profit per month $,600. 3
14 Linear Programming: General Description. Constructing the Model for an Applied Linear Programming Problem.. Introduce decision variables.. Summarize relevant material (in table form). 3. Determine the objective and write a linear objective function. 4. Write problem constraints using linear equations and inequalities. 5. Write nonnegative constraints. Geometric Solution of Linear Programming Problems.. Graph the feasible region. If an optimal solution exists (according to the formulated criteria), find the coordinates of each corner point of feasible region.. Construct a corner point table listing the values of the objective function at each corner point. 3. Determine the optimal solution from the table constructed. 4. For an applied problem, interpret the optimal solution(s) in terms of the original problem. 4
Finite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More informationChapter 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 informationSystems 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 informationLinear Programming: A Geometric Approach
Chapter 3 Linear Programming: A Geometric Approach 3.1 Graphing Systems of Linear Inequalities in Two Variables The general form for a line is ax + by + c =0. The general form for a linear inequality is
More informationx Boundary Intercepts Test (0,0) Conclusion 2x+3y=12 (0,4), (6,0) 0>12 False 2x-y=2 (0,-2), (1,0) 0<2 True
MATH 34 (Finite Mathematics or Business Math I) Lecture Notes MATH 34 Module 3 Notes: SYSTEMS OF INEQUALITIES & LINEAR PROGRAMMING 3. GRAPHING SYSTEMS OF INEQUALITIES Simple Systems of Linear Inequalities
More informationQuestion 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 informationUNIT 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 informationExample Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12. Linear Programming: A Geometric Approach
Linear Programming: A Geometric Approach 3.1: Graphing Systems of Linear Inequalities in Two Variables Example Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12.
More informationSection Graphing Systems of Linear Inequalities
Section 3.1 - Graphing Systems of Linear Inequalities Example 1: Find the graphical solution of the inequality y x 0. Example 2: Find the graphical solution of the inequality 5x 3y < 15. 1 How to find
More informationReview for Mastery Using Graphs and Tables to Solve Linear Systems
3-1 Using Graphs and Tables to Solve Linear Systems A linear system of equations is a set of two or more linear equations. To solve a linear system, find all the ordered pairs (x, y) that make both equations
More informationLesson 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 informationWEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)
WEEK 4 REVIEW Graphing Systems of Linear Inequalities (3.1) Linear Programming Problems (3.2) Checklist for Exam 1 Review Sample Exam 1 Graphing Linear Inequalities Graph the following system of inequalities.
More informationMathematics 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 informationMath 1313 Prerequisites/Test 1 Review
Math 1313 Prerequisites/Test 1 Review Test 1 (Prerequisite Test) is the only exam that can be done from ANYWHERE online. Two attempts. See Online Assignments in your CASA account. Note the deadline too.
More informationLecture 14. Resource Allocation involving Continuous Variables (Linear Programming) 1.040/1.401/ESD.018 Project Management.
1.040/1.401/ESD.018 Project Management Lecture 14 Resource Allocation involving Continuous Variables (Linear Programming) April 2, 2007 Samuel Labi and Fred Moavenzadeh Massachusetts Institute of Technology
More informationMathematics. 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 informationOPERATIONS 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 informationSection 3.1 Graphing Systems of Linear Inequalities in Two Variables
Section 3.1 Graphing Systems of Linear Inequalities in Two Variables Procedure for Graphing Linear Inequalities: 1. Draw the graph of the equation obtained for the given inequality by replacing the inequality
More informationGraphical 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 informationSection 2.1 Graphs. The Coordinate Plane
Section 2.1 Graphs The Coordinate Plane Just as points on a line can be identified with real numbers to form the coordinate line, points in a plane can be identified with ordered pairs of numbers to form
More informationLinear 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 informationax + 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 informationChapter 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 informationLinear Programming Problems
Linear Programming Problems Linear inequalities are important because we often want to minimize or maximize a quantity (called the objective function) subject to certain constraints (linear inequalities).
More informationThe base of a solid is the region in the first quadrant bounded above by the line y = 2, below by
Chapter 7 1) (AB/BC, calculator) The base of a solid is the region in the first quadrant bounded above by the line y =, below by y sin 1 x, and to the right by the line x = 1. For this solid, each cross-section
More informationII. 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 informationGraphical 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 informationUNIT 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 informationa) 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 informationAlgebra 2 Notes Systems of Equations and Inequalities Unit 03b. Optimization with Linear Programming
Optimization with Linear Programming Big Idea Linear programming is one of the most practical uses of mathematics in the real world. The inequalities of the system represent the constraints in the problem
More informationCHAPTER 4 Linear Programming with Two Variables
CHAPTER 4 Linear Programming with Two Variables In this chapter, we will study systems of linear inequalities. They are similar to linear systems of equations, but have inequalitites instead of equalities.
More information6.5. SYSTEMS OF INEQUALITIES
6.5. SYSTEMS OF INEQUALITIES What You Should Learn Sketch the graphs of inequalities in two variables. Solve systems of inequalities. Use systems of inequalities in two variables to model and solve real-life
More informationReal 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 informationLinear Programming Problems: Geometric Solutions
Linear Programming Problems: Geometric s Terminology Linear programming problems: problems where we must find the optimum (minimum or maximum) value of a function, subject to certain restrictions. Objective
More informationMath 370 Exam 1 Review Name. Use the vertical line test to determine whether or not the graph is a graph in which y is a function of x.
Math 370 Exam 1 Review Name Determine whether the relation is a function. 1) {(-6, 6), (-6, -6), (1, 3), (3, -8), (8, -6)} Not a function The x-value -6 corresponds to two different y-values, so this relation
More informationSection 3.1 Graphing Systems of Linear Inequalities in Two Variables
Section 3.1 Graphing Systems of Linear Inequalities in Two Variables Procedure for Graphing Linear Inequalities: 1. Draw the graph of the equation obtained for the given inequality by replacing the inequality
More informationLINEAR 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 informationCHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD
CHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD Linear programming is optimization problem where the objective function is linear and all equality and inequality constraints are linear. This problem was first
More informationWHAT YOU SHOULD LEARN
GRAPHS OF EQUATIONS WHAT YOU SHOULD LEARN Sketch graphs of equations. Find x- and y-intercepts of graphs of equations. Use symmetry to sketch graphs of equations. Find equations of and sketch graphs of
More informationSection Graphing Systems of Linear Inequalities
Section 3.1 - Graphing Systems of Linear Inequalities Example 1: Find the graphical solution of the inequality y x 0. Example 2: Find the graphical solution of the inequality 5x 3y < 15. 1 Example 3: Determine
More informationChapter 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 information1 GIAPETTO S WOODCARVING PROBLEM
1 GIAPETTO S WOODCARVING PROBLEM EZGİ ÇALLI OBJECTIVES CCSS.MATH.CONTENT.HSA.REI.D.12: Graph the solutions to a linear inequality in two variables as a half-plane (excluding the boundary in the case of
More informationChapter 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 informationIntroduction to PDEs: Notation, Terminology and Key Concepts
Chapter 1 Introduction to PDEs: Notation, Terminology and Key Concepts 1.1 Review 1.1.1 Goal The purpose of this section is to briefly review notation as well as basic concepts from calculus. We will also
More informationChapter 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 informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More informationLINEAR 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 information3.1 Graphing Linear Inequalities
3.1 Graphing Linear Inequalities I. Inequalities A. Introduction Many mathematical descriptions of real situations are best expressed as inequalities rather than equations. For example, a firm might be
More informationChapter 3: Section 3-2 Graphing Linear Inequalities
Chapter : Section - Graphing Linear Inequalities D. S. Malik Creighton Universit, Omaha, NE D. S. Malik Creighton Universit, Omaha, NE Chapter () : Section - Graphing Linear Inequalities / 9 Geometric
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More information3x + y 50. y=10. x=15 3x+y=50. 2x + 3y = 40
Section 3.3: Linear programming: A geometric approach In addition to constraints, linear programming problems usually involve some quantity to maximize or minimize such as profits or costs. The quantity
More informationThree Dimensional Geometry. Linear Programming
Three Dimensional Geometry Linear Programming A plane is determined uniquely if any one of the following is known: The normal to the plane and its distance from the origin is given, i.e. equation of a
More informationRectangular Coordinates in Space
Rectangular Coordinates in Space Philippe B. Laval KSU Today Philippe B. Laval (KSU) Rectangular Coordinates in Space Today 1 / 11 Introduction We quickly review one and two-dimensional spaces and then
More information+ Solving Linear Inequalities. Mr. Smith IM3
+ Solving Linear Inequalities Mr. Smith IM3 + Inequality Symbols < > Less than Greater than Less than or equal to Greater than or equal to Not equal to + Linear Inequality n Inequality with one variable
More informationSection 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 informationSolve the following system of equations. " 2x + 4y = 8 # $ x 3y = 1. 1 cont d. You try:
1 Solve the following system of equations. " 2x + 4y = 8 # $ x 3y = 1 Method 1: Substitution 1. Solve for x in the second equation. 1 cont d Method 3: Eliminate y 1. Multiply first equation by 3 and second
More informationUsing Linear Programming for Management Decisions
Using Linear Programming for Management Decisions By Tim Wright Linear programming creates mathematical models from real-world business problems to maximize profits, reduce costs and allocate resources.
More informationAlgebra Unit 2: Linear Functions Notes. Slope Notes. 4 Types of Slope. Slope from a Formula
Undefined Slope Notes Types of Slope Zero Slope Slope can be described in several ways: Steepness of a line Rate of change rate of increase or decrease Rise Run Change (difference) in y over change (difference)
More informationTopic 6: Calculus Integration Volume of Revolution Paper 2
Topic 6: Calculus Integration Standard Level 6.1 Volume of Revolution Paper 1. Let f(x) = x ln(4 x ), for < x
More information2.6: Solving Systems of Linear Inequalities
Quick Review 2.6: Solving Systems of Linear Inequalities = - What is the difference between an equation and an inequality? Which one is shaded? Inequality - When is the line solid?, - When is the line
More informationLinear Programming. Meaning of Linear Programming. Basic Terminology
Linear Programming Linear Programming (LP) is a versatile technique for assigning a fixed amount of resources among competing factors, in such a way that some objective is optimized and other defined conditions
More informationChapter 4 Section 1 Graphing Linear Inequalities in Two Variables
Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables
More information5-8. Systems of Linear Inequalities. Vocabulary. Lesson. Mental Math
Lesson 5-8 Systems of Linear Inequalities Vocabulary feasible set, feasible region BIG IDEA The solution to a system of linear inequalities in two variables is either the empty set, the interior of a polygon,
More informationSystems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses
5 5 Systems and Matrices Systems and Matrices 5.6 Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses Sections 5.6 5.8 2008 Pearson Addison-Wesley. All rights
More informationMA30SA 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 informationMath 2 Coordinate Geometry Part 3 Inequalities & Quadratics
Math 2 Coordinate Geometry Part 3 Inequalities & Quadratics 1 DISTANCE BETWEEN TWO POINTS - REVIEW To find the distance between two points, use the Pythagorean theorem. The difference between x 1 and x
More informationApplications 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 informationChapter 2 - An Introduction to Linear Programming
True / False 1. Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution. TOPICS: Introduction 2. In a linear programming problem, the objective function
More informationIntegrated Mathematics I Performance Level Descriptors
Limited A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Integrated Mathematics I. A student at this level has an emerging ability to demonstrate
More informationIntroduction to Linear Programming
Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940
More informationMath 414 Lecture 2 Everyone have a laptop?
Math 44 Lecture 2 Everyone have a laptop? THEOREM. Let v,...,v k be k vectors in an n-dimensional space and A = [v ;...; v k ] v,..., v k independent v,..., v k span the space v,..., v k a basis v,...,
More informationEach point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P.
Lecture 7, Part I: Section 1.1 Rectangular Coordinates Rectangular or Cartesian coordinate system Pythagorean theorem Distance formula Midpoint formula Lecture 7, Part II: Section 1.2 Graph of Equations
More informationLinear Programming. Linear Programming. Linear Programming. Example: Profit Maximization (1/4) Iris Hui-Ru Jiang Fall Linear programming
Linear Programming 3 describes a broad class of optimization tasks in which both the optimization criterion and the constraints are linear functions. Linear Programming consists of three parts: A set of
More informationLecture 5. If, as shown in figure, we form a right triangle With P1 and P2 as vertices, then length of the horizontal
Distance; Circles; Equations of the form Lecture 5 y = ax + bx + c In this lecture we shall derive a formula for the distance between two points in a coordinate plane, and we shall use that formula to
More informationCURVE 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 informationLinear Programming. You can model sales with the following objective function. Sales 100x 50y. x 0 and y 0. x y 40
Lesson 9.7 Objectives Solve systems of linear inequalities. Solving Systems of Inequalities Suppose a car dealer nets $500 for each family car (F) sold and $750 for each sports car (S) sold. The dealer
More informationLinear 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 informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationUsing the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8719-E October 1998 $2.50 Using the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood A key problem faced by managers is how to
More informationLinear programming II João Carlos Lourenço
Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,
More informationGRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS
SECTION 3.1: GRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS We start with a reminder of the smart way to graph a Linear Equation for the typical example we see in this course, namely using BOTH X- and
More informationCHAPTER 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 informationBCN 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 informationHonors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1
Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationOPTIMIZATION: Linear Programming
May 21, 2013 OPTIMIZATION: Linear Programming Linear programming (OPTIMIZATION) is the process of taking various linear inequalities (constraints) related to some situation, and finding the "best" value
More informationx + 2 = 0 or Our limits of integration will apparently be a = 2 and b = 4.
QUIZ ON CHAPTER 6 - SOLUTIONS APPLICATIONS OF INTEGRALS; MATH 15 SPRING 17 KUNIYUKI 15 POINTS TOTAL, BUT 1 POINTS = 1% Note: The functions here are continuous on the intervals of interest. This guarantees
More informationChapter 2 An Introduction to Linear Programming
Chapter 2 An Introduction to Linear Programming MULTIPLE CHOICE 1. The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint
More information1. Evaluating the objective function at each of the corner points we obtain the following table. Vertex Z = 2x + 3y (1,1) 5 (8,5) 31 (4,9) 35 (2,8) 28
3.3 CONCEPT QUESTIONS, page 192 1. a. The feasible set is the set of points satisfying the constraints associated with the linear programming problem. b. A feasible solution of a linear programming problem
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationFoundations of Mathematics 11
6.1 Graphing Linear Inequalities in Two Variables (Part 1) Review of Graphing Linear Equations: Most linear equations will be written in one of two different forms: 0 General form Slope y-intercept form
More informationLesson 6 - Practice Problems
Lesson 6 - Practice Problems Section 6.1: Characteristics of Quadratic Functions 1. For each of the following quadratic functions: Identify the coefficients a, b and c. Determine if the parabola opens
More informationMiddle School Math Course 3
Middle School Math Course 3 Correlation of the ALEKS course Middle School Math Course 3 to the Texas Essential Knowledge and Skills (TEKS) for Mathematics Grade 8 (2012) (1) Mathematical process standards.
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationIntroduction to Linear Programming
Introduction to Linear Programming Linear Programming Applied mathematics is all about applying mathematical techniques to understand or do something practical. Optimization is all about making things
More informationOhio s State Tests ITEM RELEASE SPRING 2018 INTEGRATED MATHEMATICS I
Ohio s State Tests ITEM RELEASE SPRING 2018 INTEGRATED MATHEMATICS I Table of Contents Content Summary and Answer Key... iii Question 1: Question and Scoring Guidelines... 1 Question 1: Sample Responses...
More informationGraphing Linear Equations
Graphing Linear Equations A.REI.10 Understand that the graph of an equation in two variables is the set of all its solutions plotted in the coordinate plane. What am I learning today? How to graph a linear
More informationAnswer Section ID: A MULTIPLE CHOICE
FOUNDATIONS MATH 11 - CHAPTER 6 - PRETEST Answer Section parent/guardian signature MULTIPLE CHOICE 1. ANS: C 2. ANS: B 3. ANS: B 4. ANS: C REF: Lesson 6.2 TOP: Exploring graphs of systems of linear inequalities
More information0,0 is referred to as the end point.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 Chapter 2: Radical Functions 2.1 Radical Functions and Transformations (Day 1) For the function y x, the radicand, x, must
More informationSection 4.5 Linear Inequalities in Two Variables
Section 4.5 Linear Inequalities in Two Variables Department of Mathematics Grossmont College February 25, 203 4.5 Linear Inequalities in Two Variables Learning Objectives: Graph linear inequalities in
More information