Linear Programming The Graphical Method Review Problems

Slides:



Advertisements
Similar presentations
Linear Programming Project. Warm-Up Write an Inequality for the following.
Advertisements

A 4-H Club member raises only geese (x) and pigs (y).
456/556 Introduction to Operations Research Chapter 3: Introduction to Linear Programming.
Lesson 08 Linear Programming
Linear Programming Problem
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
NCEA Questions. Question Andy’s confectionery shop sells sweets. Bags of wine gums and jaffas are put together in two different combinations. Small.
Managerial Decision Modeling with Spreadsheets
Objective 3-4 Linear Programming Solve linear programming problems.
(1/24 and 1/27) Bellwork: 1)List 2 things we’ve discussed this semester 2)What is one positive thing you’d be willing to share?
B-1 Operations Management Linear Programming Module B.
B-1 Operations Management Linear Programming Module B.
Inequalities Continues
Unit 1 Linear programming. Define: LINEAR PROGRAMMING – is a method for finding a minimum or maximum value of some quantity, given a set of constraints.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Systems of Equations and Inequalities
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
S YSTEMS OF INEQUALITIES J EOPARDY By Myia, Erin, and Maddy.
Ardavan Asef-Vaziri Systems and Operations Management
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Any problem.
Feasible region is the unshaded area and satisfies: x + y  x + y  x + 2y  2400 x  0 and y  0 SOLUTION.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Objective Vocabulary Solve linear programming problems.
 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.
3.5 Linear Programming Warm-up (IN) 1. Solve the system: (5, 2)
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
Warm-Up Graph the following system of inequalities. Find the coordinates at each vertices.
MANGT 521 (B): Quantitative Management
5 minutes Warm-Up 1) Solve the system. 2) Graph the solution.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
Linear Programming Ex1) Use the system of constraints below to maximize the objective function z = -0.4x + 3.2y. Corner Points.
LINEAR PROGRAMMING MEANING:
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
Math Jeopardy F $100 F $200 E $300 E $400 Abs $500 Abs $100 LF $200 LF $300 LF $400 SP $500 SP $100 LP $200 LP $300 LP $400 LP $500 LP $100 LP $200 LP.
Now have a go at finding the regions for the other 5 sets of coordinates.
Linear Programming Applications
Linear Programming Models: Graphical and Computer Methods
Linear Programming.
Engineering Economics (2+0)
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Applications of Linear Programming
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.
3-3 Linear Programming.
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Digital Lesson Linear Programming.
Lesson 4-3 System of Inequalities
Determining the optimal solution to a real-world engineering problem
Operations Management Linear Programming Module B
Applications of Linear Programming
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Chapter 7: Lesson 7.6 Linear Programming
Warm Up Solve the system: 2x + y – 3z = -6 x – y + 2z = 5
3-3 Optimization with Linear Programming
Copyright ©2015 Pearson Education, Inc. All right reserved.
Linear Programming Objectives: Set up a Linear Programming Problem
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Objective Vocabulary Solve linear programming problems.
3.4b: Linear Programming ~ Application
LESSON 6–5 Linear Optimization.
Optimization Problems
Chapter 7: Systems of Equations and Inequalities; Matrices
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Copyright © 2019 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
10.8 Linear Programming.
Linear Programming.
Presentation transcript:

Linear Programming The Graphical Method Review Problems Finite 3-R

This whole test is completed without the aid of a chromebook You may use a calculator on the whole test This is an 80 point test Test Information

Review Problems 1

Review Problems 2

Review Problems 3

Review Problems 4

Review Problems 5

Review Problems 6

Review Problems 7

Review Problems 8

Review Problems 9

Review Problems 10

Review Problems 11

Graph the following system of inequalities Graph the following system of inequalities. Name the coordinates of the vertices of the feasible region. Find the maximum and minimum values of the function f(x, y) = 3x – 2y for this region. x ≤ 5 y ≤ 4 x + y ≥ 2 The maximum value is 21 at (5, –3). The minimum value is –14 at (–2, 4). Review Problems 12

Graph the following system of inequalities Graph the following system of inequalities. Name the coordinates of the vertices of the feasible region. Find the maximum and minimum values of the function f(x, y) = 2x + 3y for this region. –x + 2y ≤ 2 x – 2y ≤ 4 x + y ≥ –2 The vertices are at (–2, 0) and (0, –2). There is no maximum value. The minimum value is –6 at (0, –2). Review Problems 13

Review Problems 14

Practice 15

Practice 16

Practice 17

Practice 18

Practice 19

Practice 20

Practice 21

Practice 22

The Cruiser Bicycle Company makes two styles of bicycles: the Traveler, which sells for $300, and the Tourister, which sells $600. Each bicycle has the same frame and tires, but the assembly and painting time required for the Traveler is only 1 hour, while it is 3 hours for the Tourister. There are 300 frames and 360 hours of labor available for production. How many bicycles of each model should be produced to maximize revenue? Review Problems 23

TV Electronics Inc. makes console and wide-screen televisions TV Electronics Inc. makes console and wide-screen televisions. The equipment in the factory allows for manufacturing at most 450 console televisions and 200 wide-screen televisions in one month. The chart below shows the cost of making each type of television, as well as the profit for each. During the month of November, the company can spend $360,000 to make these televisions. How many of each type should be produced in order to maximize profit? What is the maximum profit? 300 Consoles and 200 Widescreens for $77,500 Review Problems 24

Stitches Inc. can make at most 30 jean jackets and 20 leather jackets in a week. It takes a worker 10 hours to make a jean jacket and 20 hours to make a leather jacket. The total number of hours by all of the employees can be no more than 500 hours per week. The profit on a jean jacket is $20, and the profit on a leather jacket is $50. How many of each type should be produced in order to maximize profit? What is the maximum profit? 10 Jean Jackets and 20 Leather Jackets for $1200 Review Problems 25

You need to buy some filing cabinets You need to buy some filing cabinets. You know that Cabinet X costs $10 per unit, requires six square feet of floor space, and holds eight cubic feet of files. Cabinet Y costs $20 per unit, requires eight square feet of floor space, and holds twelve cubic feet of files. You have been given $140 for this purchase, though you don't have to spend that much. The office has room for no more than 72 square feet of cabinets. How many of which model should you buy, in order to maximize storage volume? you should obtain a maximal volume of100 cubic feet by buying eight of model X and three of model Y Review Problems 26

In order to ensure optimal health (and thus accurate test results), a lab technician needs to feed the rabbits a daily diet containing a minimum of 24 grams (g) of fat, 36 g of carbohydrates, and 4 g of protien. But the rabbits should be fed no more than five ounces of food a day. Rather than order rabbit food that is custom-blended, it is cheaper to order Food X and Food Y, and blend them for an optimal mix. Food X contains 8 g of fat, 12 g of carbohydrates, and 2 g of protein per ounce, and costs $0.20 per ounce. Food Y contains 12 g of fat, 12 g of carbohydrates, and 1 g of protein per ounce, at a cost of $0.30 per ounce. What is the optimal blend? you should get a minimum cost of sixty cents per daily serving , using three ounces of Food X only . Review Problems 27

A calculator company produces a scientific calculator and a graphing calculator. Long-term projections indicate an expected demand of at least100 scientific and 80 graphing calculators each day. Because of limitations on production capacity, no more than 200 scientific and 170graphing calculators can be made daily. To satisfy a shipping contract, a total of at least 200 calculators much be shipped each day. If each scientific calculator sold results in a $2 loss, but each graphing calculator produces a $5 profit, how many of each type should be made daily to maximize net profits? 100 scientific calculators and 170 graphing calculators Review Problems 28

A store sells two types of toys, A and B A store sells two types of toys, A and B. The store owner pays $8 and $14 for each one unit of toy A and B respectively. One unit of toys A yields a profit of $2 while a unit of toys B yields a profit of $3. The store owner estimates that no more than 2000 toys will be sold every month and he does not plan to invest more than $20,000 in inventory of these toys. How many units of each type of toys should be stocked in order to maximize his monthly total profit? The store owner has to have 1333 toys of type A and 667 toys of type B in order to maximize his profit. Review Problems 29

ANSWERS

The vertices are at (–2, 0) and (0, –2). There is no maximum value The vertices are at (–2, 0) and (0, –2). There is no maximum value. The minimum value is –6 at (0, –2). The maximum value is 21 at (5, –3). The minimum value is –14 at (–2, 4). ANSWERS

You should obtain a maximal volume of100 cubic feet by buying eight of model X and three of model Y You should get a minimum cost of sixty cents per daily serving , using three ounces of Food X only. 100 scientific calculators and 170 graphing calculators The store owner has to have 1333 toys of type A and 667 toys of type B in order to maximize his profit. 300 Consoles and 200 Widescreens for $77,500 10 Jean Jackets and 20 Leather Jackets for $1200 ANSWERS