Linear Programming Objectives: Set up a Linear Programming Problem

Slides:



Advertisements
Similar presentations
Chapter 5 Linear Inequalities and Linear Programming
Advertisements

5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Lesson 7.6, page 767 Linear Programming
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Linear Programming. Many problems involve quantities that must be maximized or minimized. Businesses are interested in maximizing profit. An operation.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Solve problems by using linear programming.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
Systems of Inequalities in Two Variables Sec. 7.5a.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
Linear Programming Advanced Math Topics Mrs. Mongold.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
Warm-up Solve each system of equations:
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.5 Linear Programming.
Linear Programming-Bellwork
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
3-5: Linear Programming. Learning Target I can solve linear programing problem.
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Chapter 3 Section 4 Linear Programming Algebra 2 January 29, 2009.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
Linear programming Lecture (4) and lecture (5). Recall An optimization problem is a decision problem in which we are choosing among several decisions.
Section 7.5 Linear Programming Math in Our World.
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
3.3 and 3.4 Applications of Linear Models
3.3 Linear Programming.
Digital Lesson Linear Programming.
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
Chapter 5 Linear Inequalities and Linear Programming
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
ALGEBRA II HONORS/GIFTED SECTION 3-4 : LINEAR PROGRAMMING
Linear Systems Chapter 3.
3-3 Optimization with Linear Programming
Math3H – Unit 2 Day 3 Linear Programming
Algebra: Graphs, Functions, and Linear Systems
3-4 Linear Programming.
Factor as many polynomials as you can.
Linear Programming Example: Maximize x + y x and y are called
Graphical Solution of Linear Programming Problems
Systems of Inequalities and Linear Programming
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Nature does nothing uselessly.
Section Linear Programming
1.6 Linear Programming Pg. 30.
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

Linear Programming Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem

Objective function: an algebraic expression (linear expression) in two variables describing a quantity that must be maximized or minimized Constraints: a collection of linear inequalities (system of linear inequalities) involving the variables that must be satisfied simultaneously Feasible point(s): those point(s) that maximize or minimize the objective function Linear Programming: a method for solving problems in which a particular quantity that must be maximized or minimized is limited by other factors

Solving a Linear Programming Problem Let be an objective function that depends on . Furthermore, is subject to a number of constraints on . If a maximum or minimum value of exists, it can be determined as follows: Graph the system of inequalities representing the constraints Find the value of the objective function at each corner, or vertex, of the graphed region. The maximum and minimum of the objective function occur at one or more of the corner points.

Steps: 1. Write an expression for the quantity to maximized or minimized. This expression is the objective function. 2. Write all the constraints as a system of linear inequalities and graph the system. 3. List the corner points of the graph of the feasible points. 4. List the corresponding values of the objective function at each corner point. The largest or smallest of these values is the solution.

EX 1: Solve the Linear Programming Problem Maximize Subject to EX 1: Solve the Linear Programming Problem

EX 2: Solve the Linear Programming Problem Minimize Subject to EX 2: Solve the Linear Programming Problem

EX 3: A manufacturer produces two models of mountain bicycles EX 3: A manufacturer produces two models of mountain bicycles. The times (in hours) required for assembling and painting each model are given in the following table: The maximum total weekly hours available in the assembly department and the paint department are 200 hours and 108 hours respectively. The profits per unit are $25 for model A and $15 for model B. How many of each type should be produced to maximize profit? Model A Model B Assembling 5 4 Painting 2 3