00
Days
00
Hrs
00
Min
00
Sec
Submit Your Paper

A Critical Review of the Application of the Simplex Method on Profit Maximization in Baker’s Cottage

Authors

Enyi Patrick Enyi

Department of Accounting, Babcock University, Ilishan-Remo, Nigeria (Nigeria)

Article Information

DOI: 10.51583/IJLTEMAS.2026.150800094

Subject Category: Education

Volume/Issue: 15/8 | Page No: 1293-1302

Publication Timeline

Submitted: 2026-08-30

Accepted: 2026-09-04

Published: 2026-09-18

Abstract

This review critically examines the application of the simplex method for profit maximization in Baker’s Cottage as reported by Azman et al. (2022). The reviewed study formulated a linear programming model involving five bakery products and seven production resources and used Microsoft Excel Solver to identify a profit-maximizing product mix with a reported monthly profit of RM40,270.42. Although the study provides a useful practical demonstration of linear programming in production planning, this review identifies important analytical and interpretive limitations. In particular, the reported solution was presented as optimal without sufficient intermediate simplex information, such as a final simplex tableau or reduced-cost analysis, to permit independent verification. An independent simplex solution using ValuStats (VSP) 2.0 confirms the reported maximum profit and resource-slack values but reveals that the optimal allocation involves Chicken Floss, Spicy Floss and Frank Cheese rather than only Chicken Floss and Frank Cheese as emphasized in the original article. The review further demonstrates that water and sugar are the binding constraints, while flour, yeast, egg, milk and butter have substantial unused capacities. A supplementary case study illustrates how slack-variable values can provide additional information for resource-allocation and managerial decisions. The review concludes that simplex-based analysis should extend beyond the identification of an optimal objective value to include explicit optimality verification and meaningful interpretation of binding and non-binding constraints. Such an approach enhances the reproducibility, managerial relevance and decision-support value of linear programming applications.

Keywords

Linear programming; simplex method; profit maximization; Baker’s Cottage; slack variables; resource allocation; Excel Solver; optimality.

Downloads

References

1. Anieting, A. E., Ezugwu, V. O., & Ologun, S. (2013). Application of linear programming technique in the determination of optimum production capacity. IOSR Journal of Mathematics, 5(6), 60–65. https://doi.org/10.9790/5728-0566265⁠� [Google Scholar] [Crossref]

2. Azman, N. Z. M., Mohamed, N. A., Mohamed, N. F., & Musa, M. (2022). Application of the simplex method on profit maximization in Baker’s Cottage. Indonesian Journal of Electrical Engineering and Computer Science, 27(2), 1034–1042. https://doi.org/10.11591/ijeecs.v27.i2.pp1034-1042⁠� [Google Scholar] [Crossref]

3. Enyi, P. E. (2012). The sub-optimal effect of the simplex solution method in resource allocation using the linear programming model. American International Journal of Contemporary Research, 2(8), 185–193. [Google Scholar] [Crossref]

4. Keyeke, G. C. (2006). Operations research. QAT Publishers. [Google Scholar] [Crossref]

5. Levin, R. I., Kirkpatrick, C. A., & Rubin, D. S. (2005). Quantitative approaches to management. McGraw-Hill. [Google Scholar] [Crossref]

6. Mohan, L. (2018). Application of linear programming for optimal use of raw materials in bakery. Research Review International Journal of Multidisciplinary, 3(11), 1168–1172. [Google Scholar] [Crossref]

7. Oladejo, N. K., Abolarinwa, A., & Salawu, S. O. (2020). Linear programming and its application techniques in optimizing portfolio selection of a firm. Journal of Applied Mathematics, 2020, Article 8817909. https://doi.org/10.1155/2020/8817909⁠� [Google Scholar] [Crossref]

8. Pan, P.-Q. (2025). Face method: Toward the new generation of linear programming. Springer. https://doi.org/10.1007/978-3-031-93594-7⁠� [Google Scholar] [Crossref]

9. Shakirullah, F. M., Ahammad, M. U., & Uddin, M. F. (2020). Profit optimization of an apparel industry in Bangladesh by linear programming model. American Journal of Applied Mathematics, 8(4), 182–189. https://doi.org/10.11648/j.ajam.20200804.13⁠� [Google Scholar] [Crossref]

10. Sogunro, A., & Adekanye, F. (2009). Linear programming for business, banking and finance. F & A Publishers. [Google Scholar] [Crossref]

11. Stafford, L. W. T. (1981). Business mathematics (2nd ed.). Macdonald and Evans. [Google Scholar] [Crossref]

12. Tripathi, S. K., & Kumar, R. (2023). A short literature on linear programming problem. EAI Endorsed Transactions on Energy Web, 10. https://doi.org/10.4108/ew.4516⁠� [Google Scholar] [Crossref]

13. Wolde, B. C., & Larsson, T. (2024). A steepest feasible direction method for linear programming: Derivation and embedding in the simplex method. Operations Research and Decisions, 34(2), 163–182. https://doi.org/10.37190/ord2402010⁠� [Google Scholar] [Crossref]

Metrics

Views & Downloads

Similar Articles

© 2026 IJLTEMAS · RSIS International. All rights reserved. ISSN 2278-2540.