Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  optimation
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
PT. Naruna is a ceramics factory located in Salatiga, Indonesia. In PT. Naruna ceramics, all products are handmade with contemporary designs and have a high artistic value in shape and color. Getting profit is the company's primary goal, but many companies still need to learn the maximum profit that can be obtained by optimizing their resources, one of which is PT. Naruna. PT. Naruna produces goods based on intuition. As a result, a lot of goods are piled up in warehouses. Meanwhile, with the development of the times, new trends and images will appear more attractive so that consumer tastes and motifs from ceramics will change. In addition, ceramic products that have gone through the combustion process cannot be recycled and must be burned. This research focuses on the production of glasses with three different types according to price. The aim of this paper is to optimize profits by determining the composition of the number of products produced. We used linear programming with a simplex method to solve our problem in PT. Naruna. Linear programming is the most appropriate method for solving problems that exist in PT. Naruna, namely by paying attention to the objective and constraint functions. The objective function is to maximize profit, so it takes the form of a linear equation with the variable X1 being the first type of glass, X2 being the second type of glass, and X3 being the third type of glass. The constraint functions used include the number of products, the number of workers, the amount of clay, and the time for production. The results show that PT. Naruna can achieve maximum profit when producing glass type 1 less than type 3 less than type 2.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.