Linear Programming Help Algebra 2
Favorites|Homepage
Subscriptions | sitemap
HOME > > Linear Programming Help Algebra 2

Linear Programming Help Algebra 2

[From: ] [author: ] [Date: 12-01-13] [Hit: ]
You find the vertices by finding the intersection points of the equations i listed above that correspond to the shaded region you found by testing the inequality constraints.when you find these vertices you plug them into you objective function and find which one meets the minimum or maximum solution to your problem.......
How to Graph this...

o > 0
c > 0
1o+7c > 46
317o + 281c > 2333
63.4c > 65
1o + 7c > 1300

-
let o=x, c=y

graph vertical line x=0
graph horizontal line y=0
graph horizontal line 63.4y=65 which is y=(65)/(63.4)
graph linear equations:
x+7y=46 which is y=-(1/7)x+(46/7)
317x+281y=2333 which is y=-(317/281)x+(2333/281)
x+7y=1300 which is y=-(1/7)x+(1300/7)

you are supposed to shade the different inequalities and discover the region with the most overlap
the vertices of this region has the min/max candidates for your objective function.
You find the vertices by finding the intersection points of the equations i listed above that correspond to the shaded region you found by testing the inequality constraints.

when you find these vertices you plug them into you objective function and find which one meets the minimum or maximum solution to your problem.
1
keywords: Programming,Linear,Help,Algebra,Linear Programming Help Algebra 2
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .