APPLICATION OF LINEAR PROGRAMMING FOR PROFIT MAXIMIZATION: A CASE STUDY OF A COOKIES FACTORY IN BANGLADESH
Journal: Matrix Science Mathematic (MSMK)
Author: Nazrul Islam, Afsana Yeasmin Mim, Md. Rayhan Prodhan
This is an open access article distributed under the Creative Commons Attribution License CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
Linear programming is a mathematical method for choosing the best product combination to maximize profit or decrease cost within the limitations of available resources. In this article, we have proposed the linear programming application for profit Maximization of a Biscuit Factory in Bangladesh. For linear programming problems, the Simplex algorithm provides a powerful computational tool, able to provide fast solution to very large-scale application. The optimization principal examined unit cost of production, the selling price and the quantity of different raw materials used in production. A model for the problem was formulated and optimum results derived using software that employed simplex method. Our main goal is to emphasize the uniqueness of linear programming modeling at the business level as an optimization technique, and to encourage manufacturing companies to employ linear programming to determine their optimal profit.