1313_section3o2 - Section 3.2 Linear Programming Problems A...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
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. 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.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2012 for the course MATH 1313 taught by Professor Constante during the Spring '08 term at University of Houston.

Page1 / 3

1313_section3o2 - Section 3.2 Linear Programming Problems A...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online