This preview shows pages 1–3. Sign up to view the full content.
Section 3.2 – Linear Programming
1
Section 3.2
Linear Programming Problems
A function subject to a system of constraints to be optimized (maximized or minimized)
is called an
objective function.
A system of equalities or inequalities to which an objective function is subject to are
called
constraints.
An objective function subject to a system of constraints is called a
linear programming
problem.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
2
Example 1:
The Soundex Company produces two models of clock radios.
Each model
A requires 15 min of work on assembly line I and 10 min of work on assembly line II.
Each model B requires 10 min of work on assembly line I and 12 min of work on
assembly line II.
At most, 23 hr of assembly time on line I and 22 hr of assembly time on
line II are available per Soundex’s work day.
It is anticipated that Soundex will realize a
profit of $12 on each model A and $10 on each model B.
How many clock radios of each
model should be produced per day in order to maximize Soundex’s profit?
a.
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '08
 CONSTANTE
 Math, Linear Programming, Inequalities

Click to edit the document details