November 14th, 2007, 01:32 PM  #1 
Newbie Joined: Nov 2007 Posts: 1 Thanks: 0  Linear Programming.
Solve this linear programming mixture problem: A small stereo manufacturer makes a receiver and a CD player. Each receiver takes 8 hours to assemble, 1 hour to test and ship, and earns a profit of $30. Each CD player takes 15 hours to assemble, 2 hours to test and ship, and earns a profit of $50. There are 160 hours available in the assembly department and 26 hours available in the testing and shipping department. What should the production schedule be to maximize profit? What is the maximum profit? I've got: x being the stereos y being the CD players theres 160 hours for assembly so 8x+15y<160 theres 26 hours for shipping x+2y<26 Then x>0 and y>0 as givens How do I graph all of that showing the feasible region? 
November 14th, 2007, 06:15 PM  #2  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Linear Programming.
Quick note: all of your < and > should be <= and >=. Quote:
 

Tags 
linear, programming 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Linear programming  lebesguedd  Linear Algebra  3  November 24th, 2013 11:31 AM 
help with linear programming.  psybernetic  Algebra  1  January 26th, 2012 01:37 PM 
Linear programming help  TheFool89  Linear Algebra  0  August 23rd, 2010 02:24 AM 
Linear Programming Help  anarchy404  Algebra  8  November 17th, 2009 11:18 PM 
Linear Programming  maria69  Algebra  2  February 18th, 2009 10:12 AM 