MATH 1071 LinearProgramming_11:5

# How many of each snack should he use to minimize his

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: of each snack should he use to minimize his daily cost? Minimize: C = 50S + 12M (Objective Function) Subject To: 4S + M 24 (Constraint) ^write out the words! Patrick Newberry Linear Programming November 5, 2012 3 / 14 whenever you see the words "at least" or "at most" that's an inequality! Deﬁnitions Deﬁnition The set of all points that satisfy the constraints is called the feasible region. Notes 4s+m>/= 24 when s=0 m is 24 when m=0 s=6 (the points of the line then test the origin and see which points make sense) also negative numbers dont make sense so we eliminate them Patrick Newberry Linear Programming November 5, 2012 4 / 14 Deﬁnitions Deﬁnition We say the feasible region is bounded if it can be contained inside of a...
View Full Document

## This document was uploaded on 02/18/2014 for the course MATH 1071 at Colorado.

Ask a homework question - tutors are online