# Linear Programming : Maximizing Profit

A large sporting goods store is placing an order for bicycles with its supplier. Four models can be ordered: the adult Open Trail, the adult Cityscape, the girl's Sea Sprite, and the boy's Trail bBlazer. It is assumed that every bike ordered will be sould, and their profits, respectively, are 30, 25, 22, and 20. The LP model should maximize profit. There are several conditions that the store needs to worry about. One of these is space to hold the inventory. The adult bikes need two feet, but each children's bike needs only one foot. The store has 500 feet of space. There are 1200 hours of assembly time available. The children's bikes need 4 hours each; the Open Trail needs 5 hours and the Cityscape needs 6 hours. The store would like to place an order for at least 275 bikes.

Formulate a model for this problem.

Solve your model with any computer package available to you.

How many of each kind of bike should be ordered and what will the profit be?

Enter the profit ONLY in the form xxxx or xxxx.O round to nearest dollar

© BrainMass Inc. brainmass.com October 9, 2019, 7:31 pm ad1c9bdddfhttps://brainmass.com/math/linear-programming/linear-programming-maximizing-profit-120704

#### Solution Summary

A LP problem is solved using Excel. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.