[go: up one dir, main page]
Scribd
Upload
42 views8 pages

Minimization

The document describes the steps to solve a linear programming minimization problem. The steps are: 1. Write the decision variables and objective function to minimize. 2. Write the constraints as inequalities. 3. Graph the constraints to find the feasible region. 4. Find the corner points of the feasible region. 5. Determine the corner point that gives the minimum value of the objective function. The document then works through an example problem where a professor wants to minimize the cost of grading papers by employing two people within constraints on their hours worked and minimum papers graded. It determines the optimal solution is to employ John for 4 hours and Mary for 1 hour at a cost of $85.

Uploaded by

Diana Rose Mustacisa
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
42 views8 pages

Minimization

The document describes the steps to solve a linear programming minimization problem. The steps are: 1. Write the decision variables and objective function to minimize. 2. Write the constraints as inequalities. 3. Graph the constraints to find the feasible region. 4. Find the corner points of the feasible region. 5. Determine the corner point that gives the minimum value of the objective function. The document then works through an example problem where a professor wants to minimize the cost of grading papers by employing two people within constraints on their hours worked and minimum papers graded. It determines the optimal solution is to employ John for 4 hours and Mary for 1 hour at a cost of $85.

Uploaded by

Diana Rose Mustacisa
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/ 8

Linear Programming:

MINIMIZATION
STEPS TO SOLVE A MINIMIZATION PROBLEM

1. Write the decision variables and the objective function.


2. Write the constraints. For standard minimization, the form is ax + by ≥ c. Since the
variables are non-negative, include the constraints: x ≥ 0; y ≥ 0.
3. Graph the constraints.
4. Shade the feasibility region.
5. Find the corner points.
6. Determine the corner point that gives the minimum value.
WORD PROBLEM STEP 1
Decision Variables:
At a university, the Professor wishes to employ
x = no. of hours per week John is employed
two people, John and Mary, to grade papers for his
y = no. of hours per week Mary is employed
classes. John can grade 20 papers per hour and he
earns $15, while Mary can grade 30 papers per hour
and she earns $25 per hour for it. Each must be
employed at least one hour a week to justify their Objective Function:
employment. Minimize C = 15x + 25y

If the Professor has at least 110 papers to be graded


each week, how many hours per week should he STEP 2
employ each person to minimize the cost? Constraints:
x ≥ 1 and y ≥ 1
20x + 30y ≥ 110
x ≥ 0 and  y ≥ 0
Minimize C = 15x + 25y STEP 3
Subject to:
x ≥ 1 and y ≥ 1

20x + 30y ≥ 110

x ≥ 0 and y ≥ 0

x=1
y=1
20x + 30y = 110
x y

0 3.6

5.5 0
STEP 4

Test points
(0,0):

NO
x ≥ 1 and y ≥ 1 0 ≥ 1 and 0 ≥ 1
20x + 30y ≥ 110 20(0) + 30(0) ≥ 110

(4,6):
x ≥ 1 and y ≥ 1 4 ≥ 1 and 6 ≥ 1
20x + 30y ≥ 110
YES
20(4) + 30(6) ≥ 110
260 ≥ 110
-20 (x = 1) 20x + 30y = 110 STEP 5
-20x = -20 20x + 30(3) = 110
20x + 30y = 110 20x + 90 = 110
20x = 110-90
30y = 90 20x = 20
y=3 x=1
(1,3)

-30 (y = 1) 20x + 30y = 110


-30y = -30 20(4) + 30y = 110
20x + 30y = 110 80 + 30y = 110
30y = 110-80
20x = 80 30y = 30
x=4 y=1
(4,1)
STEP 6
Minimize C = 15x + 25y The point (4, 1) gives the least cost, and
that cost is $85. Therefore, we conclude
(1,3) 15x + 25y = C that in order to minimize grading costs, the
15(1) + 25(3) = $90 Professor should employ John 4 hours a
(4,1) 15x + 25y = C week, and Mary 1 hour a week at a cost of
15(4) + 25(1) = $85 $85 per week.
THAT’S ALL FOR MINIMIZATION!

You might also like