A baker makes two types of bread loaves: "cottage" and "farmhouse".
  Let x be the number of cottage loaves and y be the number farmhouse loaves to be made each day.
   
   
  Each cottage loaf requires 500 grams of flour and 50 grams of butter.
  Each farmhouse loaf requires 300 grams of flour and 150 grams of butter.
  The baker has 4.5 kg of flour and 1.5 kg of butter available each day.
  The baker has time to bake at most 12 loaves.
   
  The baker makes a profit of 30p on each cottage loaf and 60p on each farmhouse loaf sold.
  How many of each type should be made each day to maximise potential profit?
                     
  P = x + y          
                 
                     
  Enter two points for each constraint line to generate a plot in the window below.  
  You should choose points which clearly show the region formed by the constraints.  
                     
                     
  Constraint 1 x y          
  Point 1        
  Point2        
  Constraint 2 x y          
  Point 1        
  Point2        
  Constraint 3 x y          
  Point 1        
  Point 2        
  Constraint 4 x y          
  Point 1 8 8        
  Point 2 1 1        
                     
[No canvas support]
                   
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
                     
  Starting with the corner point nearest the origin, (0, 0), enter the corner points in clockwise order:
  Give your answers rounded to 2 decinmal places.          
  Calculate "P" based on your rounded answers.          
                     
    Feasible Region Corner Points x y P    
    Corner Point 1    
    Corner Point 2    
    Corner Point 3    
    Corner Point 4    
    Corner Point 5    
                     
                     
  The objective function is maximised at corner point number: