Наука и технология в современном миреМирзаева Ширин Нодировна, Тахиров Чингиз Аъзамович +22026
OPTIMAL SOLUTION PLAN FOR MANUFACTURING ENTERPRISES USING THE SIMPLEX METHOD
THESIMPLEX METHOD · ORCID ID--- (Head ofthe Department of Information Technologies, Fergana StateUniversity ,) · Ismoiljonova Odina Isroiljonkizi (Head ofthe Department of Information Technologies, Fergana StateUniversity ,)
Международный журнал искусственного интеллекта · 05 · 22-08 · 2025
Аннотация
This article discusses the process of solving linear programming problems using the simplex method. The main steps of the simplex algorithm, their mathematical foundations and practical applications are considered. In addition, information is provided about the advantages and limitations ofthemethod. Keywords:Linear programming, simplex method, optimization, mathematical model, constraints, basicsolution. Abstract:This article discusses the process of solving linear programming problems using the simplex method. The main steps of the simplex algorithm, its mathematical foundations, and practical applications are examined. Additionally, the advantages and limitations of the methodare also presented. Key words:Linear programming, simplex method, optimization, mathematical model, constraints, basicsolution. Annotation:V dannoy state rassmatrivaetsya process solution of linear programming problem with simplex method. Description of basic stages of simplex-algorithm, its mathematical basics and practical application. Takje privedeny svedeniya o preimushchestvax i ogranicheniyax metoda. Key words:Linear programming, simplex method, optimization, mathematical model, limitation,basic solution. Login . Modern economic under the circumstances working release of enterprises main purpose from resources effective use through maximum benefit to take or expenses from minimizing Especially food industry one part was confectionery factories for working release plans right designation , product types between balance storage and there is resources ( raw materials , labor) power , time , work release capacities )optimal ina waydistribution bigimportance profession willreach . page1183 INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE ISSN:2692-5206,ImpactFactor:12,23 AmericanAcademicpublishers,volume05,issue04,2025 Journal: https://www.academicpublishers.org/journals/index.php/ijai Linear programming is one of the powerful mathematical methods used to solve such problems. In particular, the Simplex method is a widely used and practically effective algorithm in this area. In this article, the problem of optimizing the production process of a confectionery factory is formulated on the basis of a linear programming model and solved using the Simplex method. The goal is to allocate production volumes within the existing constraints in suchaway that thetotal profit ismaximized. Literature analysis The theoretical foundations of linear programming and the Simplex method were created in the middle of the 20th century by the American scientist George Dantzig, and this method is still used to solve many economic, engineering and logistics problems. Many scientific works and textbooks (for example, Taha XA “Operations Research”, R. Hilliyer and G. Lieberman “Introduction to Operations Research”) deeply analyze the theoretical foundations and practical applications of theSimplex method. A number of studies on linear programming have also been carried out by Uzbek scientists. In particular, the effectiveness of the Simplex method is emphasized in articles and textbooks on modeling, planning, and optimal resource allocation in economics. In recent years, the implementation of these methods in software based on computer technologies (such as MS Excel Solver, MATLAB, Python-PuLP) has further expanded the possibilitiesof research. Despite the lack of specialized literature on modeling production processes in the confectionery industry, there is an opportunity to apply general linear optimization approaches to real practice byadapting them. Research methodology In this study, the simplex method of linear programming was used to optimize the activities of a confectionery factory. The methodological basis of the study is mathematical modeling of the production process, that is, expressing a real problem using equations and inequalities. To do this, first of all, the main types of products produced in the factory, the types of raw materials required for them (for example, sugar, flour, oil and other components), the available resource reserves and the net profit from each unit of product were determined. After that, variables were introduced for each product and the objective function — maximizing total profit — was formulated. Resource constraints were expressed in the form of inequalities. The resulting linear programming model was made ready to be solved using the simplex method. TheSimplex algorithm was implemented step by step: first, an initial basic solution was found, and then the pivot elements were used to move towards the optimal point. With each iteration, the value of the objective function was observed to improve. In order to verify and ensure the reliability of the practical results of the study, the model was programmed in a computer program - in particular, using the PuLP library in the Python programming language. Through this automated approach, the optimal production plan was determined, the total profi
Доказательный фрагмент
«This article discusses the process of solving linear programming problems using the simplex method.»
Образец извлечения
Демо-превьюThis article discusses the process of solving linear programming problems using the simplex method. Полный текст публикации CiteX не хранит — доступ к первоисточнику открывается по DOI согласно лицензии издателя и выбранному плану.
- Цитирований
- 0
- Тип
- Журнал
- Страна
- Узбекистан
- Ключевые слова
- Linear programming, simplex method, optimization, mathematical model
Смежные источники
Наука и технология в современном миреHamdamov Islom Akramovich2026
Медицина и инновацииМ Сабиров, О Скосырева +12021