Scribd
Upload
1 views

Linear Programming

Linear programming is a mathematical modeling technique used to maximize or minimize a linear function under various constraints, beneficial in business planning and industrial engineering. It involves identifying an objective function and constraints, which can be solved graphically, as illustrated by an example involving ticket sales for an airline. The document outlines the process of defining the objective function and constraints necessary for solving linear programming problems.

Uploaded by

Shane Magno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1 views

Linear Programming

Linear programming is a mathematical modeling technique used to maximize or minimize a linear function under various constraints, beneficial in business planning and industrial engineering. It involves identifying an objective function and constraints, which can be solved graphically, as illustrated by an example involving ticket sales for an airline. The document outlines the process of defining the objective function and constraints necessary for solving linear programming problems.

Uploaded by

Shane Magno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

LINEAR

PROGRAMMING
Prof. Ricardo B. Deri
LINEAR
PROGRAMMING
GRAPHICAL METHOD
LINEAR PROGRAMMING, defined

◦Linear programming, mathematical modeling


technique in which a linear function is maximized or
minimized when subjected to various constraints. This
technique has been useful for guiding quantitative
decisions in business planning, in industrial engineering,
and—to a lesser extent—in the social and physical
sciences.
Why is linear programming important?

When you have a problem that involves a variety of


resource constraints, linear programming can generate
the best possible solution. Whether it's maximizing things
like profit or space, or minimizing factors like cost and
waste, using this tool is a quick and efficient way to
structure the problem, and find a solution.
Solving Linear Programming Problems
Graphically
A linear programming problem involves
constraints that contain inequalities. An
inequality is denoted with familiar symbols, <,
>, ≤≤, and ≥≥. Due to difficulties with strict
inequalities (< and >), we will only focus
on≤≤ and≥≥.
In order to have a linear programming problem, we
must have:
 Inequality constraints
 An objective function, that is, a function whose
value we either want to be as large as possible
(want to maximize it) or as small as possible (want
to minimize it).
An airline offers coach and first-class tickets. For the
airline to be profitable, it must sell a minimum of 25
first-class tickets and a minimum of 40 coach tickets.
The company makes a profit of $225 for each coach
ticket and $200 for each first-class ticket. At most,
the plane has a capacity of 150 travelers. How many
of each ticket should be sold in order to maximize
profits?
Solution
The first step is to identify the unknown quantities.
We are asked to find the number of each ticket that
should be sold. Since there are coach and first-class
tickets, we identify those as the unknowns. Let,
x = # of coach tickets
y = # of first-class tickets
Next, we need to identify the objective function. The
question often helps us identify the objective function.
Since the goal is the maximize profits, our objective is
identified.
Profit for coach tickets is $225. If
x coach tickets are sold, the total profit for these tickets
is 225x.
Profit for first-class tickets is $200. Similarly, if
y first class tickets are sold, the total profit for these
tickets is 200y.
The total profit, P, is
P = 225x + 200y
We want to make the value of
as large as possible, provided the constraints are
met. In this case, we have the following constraints:
 Sell at least 25 first-class tickets
 Sell at least 40 coach tickets
 No more than 150 tickets can be sold (no more
than 150 people can fit on the plane)
We need to quantify these.
 At least 25 first-class tickets means that 25 or more
should be sold. That is, y ≥≥ 25
 At least 40 coach tickets means that 40 or more
should be sold. That is, x ≥≥ 40
 The sum of first-class and coach tickets should be
150 or fewer. That is x + y ≤≤ 150
Thus, the objective function along with the three
mathematical constraints is:
Objective Function: P = 225x + 200y
Constraints: y ≥≥ 25; x ≥≥ 40; x + y ≤≤ 150
We will work to think about these constraints
graphically and return to the objective function
afterwards. We will thus deal with the following
graph:
Note that we are only interested in the first quadrant, since we cannot have
negative tickets.
We will first plot each of the inequalities as equations, and then worry about the
inequality signs. That is, first plot,
x= 25
y = 40
x + y = 150
The first two equations are horizontal and vertical
lines, respectively. To plot x + y= 150, it is
preferable to find the horizontal and vertical
intercepts.
To find the vertical intercept, we let
x = 0:
y= 150
Giving us the point (0,150)
To find the horizontal intercept, we let
y = 0:
x = 150

Giving us the point (150,0)


Plotting all three equations gives:

You might also like