BUTUN SONLI PROGRAMMALASHTIRISH: METODLAR, QO‘LLANILISH VA AMALIY AHAMIYATI

Authors

  • Quljanov Jaxongir Baxtiyorovich Samarqand iqtisodiyot va servis instituti Oliy matematika kafedrasi o’qituvchisi PhD Author
  • Akbarov Diyorbek Jamshed o’g’li Samarqand iqtisodiyot va serves instituti talabasi Author

Keywords:

Butun sonli programmalashtirish, Branch and Bound metodi, Cutting Plane metodi, optimallashtirish, resurslarni taqsimlash, iqtisodiy samaradorlik.

Abstract

Butun sonli programmalashtirish (IP) — bu chiziqli programmalashtirishning bir turi bo‘lib, unda qaror o‘zgaruvchilari faqat butun sonlar sifatida ko‘rsatiladi. Ushbu maqolada butun sonli programmalashtirish metodlari, xususan, Branch and Bound va Cutting Plane metodlarining amaliy ahamiyati tahlil qilinadi. Butun sonli programmalashtirish masalalari iqtisodiyot, sanoat, logistika va transport sohalarida keng qo‘llaniladi. Tadqiqotda ushbu metodlar yordamida qanday samarali yechimlar topish mumkinligi va ularning real hayotdagi qo‘llanilishi ko‘rsatiladi.

Downloads

Download data is not yet available.

References

Dantzig, G. B. (1947). "Linear Programming and Extensions." Princeton University Press.

Charnes, A., Cooper, W. W. (1950). "Management Models and Industrial Applications of Linear Programming." Wiley.

Gass, S. I. (2003). "Linear Programming: Methods and Applications." Dover Publications.

Taha, H. A. (2017). "Operations Research: An Introduction." Pearson.

Downloads

Published

2024-12-01

Issue

Vol. 4 No. 40 (2024): PEDAGOGICAL SCIENCES AND TEACHING METHODS

Section

Articles