This study explores the optimization of non-normal assignments utilizing the Hungarian method for both maximization and minimization. The Hungarian algorithm is a combinatorial optimization technique that efficiently solves assignment problems, ensuring optimal allocation of resources. By applying this method to non-normal assignment scenarios, we aim to demonstrate its effectiveness in enhancing productivity and reducing costs in various industries. The findings indicate that the Hungarian method can significantly improve decision-making processes in complex assignment frameworks, leading to more efficient operations.

The home industry "Eka Jaya" is a small business engaged in the production of snacks. In an effort to increase efficiency and daily profits, an optimal production planning method is needed. This study aims to maximize daily profits through the application of the simplex method in compiling the right production strategy. The simplex method is used to solve linear programming problems by maximizing the objective function in the form of profit and considering resource constraints such as raw materials, labor, and production time. The results of the study indicate that the application of the simplex method is able to provide an optimal production combination that produces maximum profit compared to the conventional method that has been used so far. Thus, this method can be used as a reference in making production decisions in the home industry "Eka Jaya".