| dc.description.abstract | The optimization of production in a multi-objective integer linear programming problem involes optimization the production quantity with multiple objective within the context of linear programming with integer constraints. Previous research attempted to find the optimal solution for the integer linear programming production optimization problem at France Bakery with the sole objective of maximizing profit. By adding the objective of minimizing production costs, this research aims to find alternative solutions to the problem using the goal programming method. With the assistance of the LINDO software, three alternative solutions were obtained. The first solutions involves producing chocolate bread, green bean bread, red bean bread, tiramisu bread, and chocolate melon bread, resulting in a profit of Rp and production costs of . The second solution includes producing chocolate bread, green bean bread, red bean bread, tiramisu bread, and chocolate melon bread, resulting in a profit of Rp and production costs of . The third solution includes producing chocolate bread, green bean bread, red bean bread, tiramisu bread, and chocolate melon bread, resulting in a profit of Rp and production costs of with the note that the stock of tiramisu flavoring is increased by 5 grams. | en_US |
