0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
67 Ansichten2 Seiten
In this lesson you learned how to solve Linear Programming problems. In either case, the value of the objective function is z = 8x + 3y. The maximum value of z is 89, and this occurs when x = 10 and y = 3.
In this lesson you learned how to solve Linear Programming problems. In either case, the value of the objective function is z = 8x + 3y. The maximum value of z is 89, and this occurs when x = 10 and y = 3.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen
In this lesson you learned how to solve Linear Programming problems. In either case, the value of the objective function is z = 8x + 3y. The maximum value of z is 89, and this occurs when x = 10 and y = 3.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen
Name______________________________________________ Section 7.6 Linear Programming
Objective: In this lesson you learned how to solve linear programming
problems.
Important Vocabulary Define each term or concept.
Optimization A process in which the minimum or maximum of a quantity is sought.
Linear programming An optimization strategy.
Objective function Gives the quantity that is to be maximized or minimized.
Constraints A system of linear inequalities that determines the region of feasible
solutions. Feasible solutions All points in a region satisfying each of the constraints.
I. Linear Programming: A Graphical Approach What you should learn
(Pages 552−555) How to solve linear programming problems If a linear programming problem has a solution, it must occur . . . at a vertex of the set of feasible solutions. If there is more than one solution to a linear programming problem, at least one of them . . . must occur at a vertex.
In either case, the value of the objective function is unique .
List the steps for solving a linear programming problem:
1. Sketch the region corresponding to the system of constraints.
The points inside or on the boundary of the region are the feasible solutions. 2. Find the vertices of the region. 3. Test the objective function at each of the vertices and select the values of the variables that optimize the objective function. For a bounded region, both a minimum and a maximum value will exist. For an unbounded region, if an optimal solution exists, it will occur at a vertex.
Larson/Hostetler Precalculus/Precalculus with Limits Notetaking Guide IAE
Example 1: The vertices of the region of feasible solutions for
a linear programming problem are as follows: (0, 0) (5, 0) (10, 3) (7, 6) (0, 4) If the objective function is z = 8x + 3y, find the maximum value and where it occurs.
The maximum value of z is 89, and this occurs
when x = 10 and y = 3.
Example 2: Find the minimum value of z = 4x + 6y subject to y
the following constraints. x≥0 ⎫ y≥0 ⎪ ⎪⎪ x + y ≥ 2⎬ y≤4 ⎪ x ⎪ x≤5 ⎭⎪
The minimum value of z is 8, and this occurs when
x = 2 and y = 0.
II. Applications of Linear Programming (Pages 556−557)
What you should learn Describe a real-life problem that can be solved using linear How to use linear programming. programming to model and solve real-life Answers will vary. problems
y y y
x x x
Homework Assignment
Page(s)
Exercises
Larson/Hostetler Precalculus/Precalculus with Limits Notetaking Guide IAE
Full download Solution Manual for Calculus for Business Economics and the Social and Life Sciences Brief Version 11th Edition by Laurence Hoffmann Gerald Bradley David Sobecki Michael Price pdf full chapter