LINEAR PROGRAMMING PROBLEMS
Keywords:
linear programming, optimization, objective function, constraints, resources, maximum profit, minimum cost, simplex method, graphical method, economic modelAbstract
This paper discusses the theoretical and practical foundations of linear programming problems. Using this method, issues of making optimal decisions under limited resources, maximizing profit, and minimizing costs are considered. The concepts of the objective function, system of constraints, and variables are explained, as well as the processes of finding solutions using graphical and simplex methods. Additionally, the importance of this method in economics and management is highlighted.
References
1.Dantzig, G.B. Linear Programming and Extensions. – Princeton University Press.
2.Kantorovich, L.V. The Best Use of Economic Resources. – Pergamon Press.
3.Taha, H.A. Operations Research: An Introduction. – Pearson Education.
4.Hillier, F.S., Lieberman, G.J. Introduction to Operations Research. – McGraw-Hill.
5.Bazaraa, M.S., Jarvis, J.J., Sherali, H.D. Linear Programming and Network Flows. – Wiley.
6.Winston, W.L. Operations Research: Applications and Algorithms. – Cengage Learning.
7.Luenberger, D.G., Ye, Y. Linear and Nonlinear Programming. – Springer.
8.Chvátal, V. Linear Programming. – Freeman.
9.Taha, H.A. Operations Research Fundamentals (based on Russian and English editions).
10.Higher education textbooks of the Republic of Uzbekistan: Economic-Mathematical Models and Methods. – Tashkent.




United Kingdom
Germany
France
Uzbekistan
Türkiye
Kazakhstan
Kyrgyzstan
Turkmenistan
Azerbaijan
India
Republic of Korea
Japan
United States of America
Kosovo
Italy
Spain
Poland
Netherlands
Belgium
Sweden
Norway
Finland
Denmark
Switzerland
Austria
Czech Republic
Hungary
Romania
Bulgaria
Greece
Portugal