Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
38 views

Module 7 B Solving Linear Inequalities Using Linear Programming

Linear programming is an optimization technique used to minimize or maximize a linear objective function subject to linear constraints. It involves writing the objective function and constraints, graphing the constraints to identify the feasible region, finding the vertices of this region, evaluating the objective function at each vertex, and selecting the optimal solution that maximizes or minimizes the objective function value. An example problem is solved to find the maximum value of an objective function z = 2x + 3y subject to four given linear constraints, with the optimal solution identified as x = 2, y = 7, which yields the maximum value of z = 25.

Uploaded by

Kick Yum
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
38 views

Module 7 B Solving Linear Inequalities Using Linear Programming

Linear programming is an optimization technique used to minimize or maximize a linear objective function subject to linear constraints. It involves writing the objective function and constraints, graphing the constraints to identify the feasible region, finding the vertices of this region, evaluating the objective function at each vertex, and selecting the optimal solution that maximizes or minimizes the objective function value. An example problem is solved to find the maximum value of an objective function z = 2x + 3y subject to four given linear constraints, with the optimal solution identified as x = 2, y = 7, which yields the maximum value of z = 25.

Uploaded by

Kick Yum
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Linear Programming

Module 7-B
Solving Linear
Inequalities Using
Linear Programming
Learning Objectives:

At the end of this module,


the students are expected to:
1. Solve linear inequalities
using linear programming.
Linear Programming

 Linear programming is an approach that


is used to minimize or maximize a linear
function given the constraints in terms of
linear inequalities.
 It is an optimization technique for
a system of linear constraints and a
linear objective function.
 An objective function defines the
quantity to be optimized (minimized or
maximized).
Linear Programming

 The goal of linear programming is to


minimize or maximize the objective
function z subject to constraints, meaning,
to find the points (x, y) that make the
value of z the largest or smallest.
 Constraints or linear constraints are a
system of linear inequalities.
Steps in Solving Linear Programming
Problems
1. Write the objective function.
This represents the quantity that is to
be minimized or maximized.
2. Write the constraints.
This is a system of linear inequalities.
3. Graph the constraints.
Graph the system of linear inequalities
and shade the common regions. The
shaded regions contain the feasible
solutions.
Steps in Solving Linear Programming
Problems
4. Identify the vertices.
The corner points of the shaded region
represent the possible maximum or
minimum values of the objective
function.
5. Evaluate the objective function for each vertex.
For each vertex or corner points of the
shaded region, substitute the coordinates
(values of x and y) into the objective function
and list the value of the objective function.
Steps in Solving Linear Programming
Problems

6. Identify the optimal solution.


The largest (maximum) or the smallest
(minimum) value of the objective function in
step 5 is the optimal solution if the feasible
region is bounded.
Solving Linear Programming
Problems

Sample Problem:
Find the maximum value of z = 2x + 3y, subject
to the constraints:
x≤5 x≥2 y≤ 0 3x + 2y ≤ 20
Solution:
Step 1. Objective function. z = 2x + 3y
Step 2. Constraints x≤5
x≥2
y≤ 0
3x + 2y ≤ 20
Solving Linear Programming Problems
3. Graph the constraints
Solving Linear Programming Problems

4. Identify the vertices


(2, 0), (5, 0), (2, 7), (5, 2½)
5. Evaluate the objective function for each vertex.
vertex x y z = 2x + 3y
(2, 0) 2 0 2(2) + 3(0) = 4
(5, 0) 5 0 2(5) + 3(0) = 10
(2, 7) 2 7 2(2) + 3(7) = 25
(5, 2½) 5 2½2(5) + 3 (2½) = 17½
6. Identify the maximum solution.
The maximum value of z is 25, which occurs
when x = 2 and y = 7.
Thank you for paying
attention!
God bless you and stay
safe!

You might also like