In this study, the limited resources of a production company are maximally allocated for the production of cake of different sizes for optimal profit making. The datasets used were collected on the profit made from four different sizes of the cake and on the available production resources of the company. The profits made from the various cake sizes form the objective function coefficients; the measurements of the various resources used for the production of the different sizes of the cake form the coefficients in the constraint equations while the total available resource quantities form the right hand sides of the constraint equations. The resultant linear programming problem was solved and the result showed the various quantities of the cake sizes that should be produced so as to make an optimal profit. Sensitivity analysis was carried out to determine the robustness of the formulated model.

No abstract