Scribd
Upload
27 views

03 02 Linear Programming Problems

Uploaded by

anjana gulati
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
27 views

03 02 Linear Programming Problems

Uploaded by

anjana gulati
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

LINEAR

3 PROGRAMMING:
A GEOMETRIC
APPROACH

Copyright © Cengage Learning. All rights reserved.


3.2 Linear Programming
Problems

Copyright © Cengage Learning. All rights reserved.


Linear Programming Problems
In many business and economic problems, we are asked to
optimize (maximize or minimize) a function subject to a
system of equalities or inequalities.

The function to be optimized is called the objective function.

Profit functions and cost functions are examples of


objective functions.

3
Linear Programming Problems
The system of equalities or inequalities to which the
objective function is subjected reflects the constraints (for
example, limitations on resources such as materials and
labor) imposed on the solution(s) to the problem.

Problems of this nature are called mathematical


programming problems.

4
A Maximization Problem

5
A Maximization Problem
As an example of a linear programming problem in which
the objective function is to be maximized, let’s consider the
following simplified version of a production problem
involving two variables.

6
Applied Example 1 – A Production Problem
Ace Novelty wishes to produce two types of souvenirs:
Type A and Type B. Each Type A souvenir will result in a
profit of $1, and each Type B souvenir will result in a profit
of $1.20.

To manufacture a Type A souvenir requires 2 minutes on


Machine I and 1 minute on Machine II. A Type B souvenir
requires 1 minute on Machine I and 3 minutes on Machine
II. There are 3 hours available on Machine I and 5 hours
available on Machine II.

How many souvenirs of each type should Ace make to


maximize its profit?
7
Example 1 – Solution
As a first step toward the mathematical formulation of this
problem, we tabulate the given information (see Table 1).

Let x be the number of Type A souvenirs and y the number


of Type B souvenirs to be made.

8
Example 1 – Solution cont’d

Then, the total profit P (in dollars) is given by

P = x + 1.2y

which is the objective function to be maximized.

The total amount of time that Machine I is used is given by


2x + y minutes and must not exceed 180 minutes.

Thus, we have the inequality

2x + y  180

9
Example 1 – Solution cont’d

Similarly, the total amount of time that Machine II is used is


x + 3y minutes and cannot exceed 300 minutes, so we are
led to the inequality

x + 3y  300

Finally, neither x nor y can be negative, so

x0

y0

10
Example 1 – Solution cont’d

To summarize, the problem at hand is one of maximizing


the objective function P = x + 1.2y subject to the system of
inequalities

2x + y  180

x + 3y  300

x0

y0

11
Example 1 – Solution cont’d

The solution to this problem will be completed in later on in


the section "Graphical Solution of Linear Programming
Problems“.

12
Minimization Problems

13
Minimization Problems
In the following linear programming problem, the objective
function is to be minimized.

14
Applied Example 2 – A Nutrition Problem
A Nutrition Problem A nutritionist advises an individual who
is suffering from iron and vitamin B deficiency to take at
least 2400 milligrams (mg) of iron, 2100 mg of vitamin B1
(thiamine), and 1500 mg of vitamin B2 (riboflavin) over a
period of time.

Two vitamin pills are suitable, Brand A and Brand B. Each


Brand A pill costs 6 cents and contains 40 mg of iron, 10
mg of vitamin B1, and 5 mg of vitamin B2.

15
Applied Example 2 – A Nutrition Problem cont’d
Each Brand B pill costs 8 cents and contains 10 mg of iron
and 15 mg each of vitamins B1 and B2 (Table 2).

What combination of pills should the individual purchase to


meet the minimum iron and vitamin requirements at the
lowest cost?
16
Example 2 – Solution
Let x be the number of Brand A pills and y the number of
Brand B pills to be purchased. The cost C (in cents) is
given by

C = 6x + 8y

and is the objective function to be minimized.

The amount of iron contained in x Brand A pills and y Brand


B pills is given by 40x + 10y mg, and this must be greater
than or equal to 2400 mg.

17
Example 2 – Solution cont’d

This translates into the inequality

40x + 10y  2400

Similar considerations involving the minimum requirements


of vitamins B1 and B2 lead to the inequalities

10x + 15y  2100

5x + 15y  1500

respectively.
18
Example 2 – Solution cont’d

Thus, the problem here is to minimize C = 6x + 8y subject


to
40x + 10y  2400

10x + 15y  2100

5x + 15y  1500

x  0,

y0
The solution to this problem will be completed in later on in
the section "Graphical Solution of Linear Programming
Problems". 19

You might also like