Sher Posted December 23, 2008 Share Posted December 23, 2008 Help me solve this linear programming problem. Can't decide whether it's a maximization/minimization problem? In the J & K grocery store, shelf space is limited and must be used effectively to increase profit. Two cereal items, Grano and Wheatie, compete for a total shelf space of 79ft^2. A box of Grano occupies 0.2ft^2 and a box of Wheatie needs 0.4ft^2. The maximum daily demands of Grano and Wheatie are 280 and 127 boxes, respectively. A box of Grano nets $1.00 in profit and a box of Wheatie $1.47. J & K thinks that because the unit profit of Wheatie is 47% higher than of Grano, Wheatie should be allocated 47% more space than Grano, which amounts to allocating about 73.5% to Wheatie and 26.5% to Grano. Can someone help me formulate the LP model for this one? I've been trying for days. I need the answer by tmrw. Please help! Thanks a million. Link to comment Share on other sites More sharing options...
chitrangda Posted December 28, 2008 Share Posted December 28, 2008 as you have been given limited space and have to use same for maximum profit,therefore it is a maximization problem.I think its enough hint to solve the problem. Link to comment Share on other sites More sharing options...
D H Posted December 28, 2008 Share Posted December 28, 2008 What is the feasibility diagram for this problem? Is the J & K proposal at a vertex of the feasibility diagram? Which vertex optimizes the profit? Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now