title: ÐÐ¸Ð½ÐµÐ¹Ð½Ð¾Ðµ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ: ÑÐ¸Ð¼Ð¿Ð»ÐµÐºÑ Ð¼ÐµÑÐ¾Ð´ Ð¸ Ð¿Ð¾ÑÐµÐ½ÑÐ¸Ð°Ð»ÑÐ½ÑÐµ Ð¿ÑÐ¾Ð±Ð»ÐµÐ¼Ñ
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Linear programming: simplex method and potential problems
Creators: name: ÐÑÐ»ÑÐº, ÐÐ»ÐµÐºÑÐ°Ð½Ð´ÑÐ°
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2021
Subjects: ÑÐ¸Ð¼Ð¿Ð»ÐµÐºÑ Ð¼ÐµÑÐ¾Ð´
Ð¼ÐµÑÐ¾Ð´Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼
Ð»Ð¸Ð½ÐµÐ¹Ð½Ð¾Ðµ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ
simplex method
optimisation methods
algorithm
linear programming

description: ÐÐ°Ð½Ð½Ð°Ñ Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ð¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° ÑÐ¸Ð¼Ð¿Ð»ÐµÐºÑ Ð¼ÐµÑÐ¾Ð´Ð° Ð¸ ÐµÐ³Ð¾ Ð¼Ð¾Ð´Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¸ Ñ Ð¿Ð¾ÑÐ»ÐµÐ´ÑÑÑÐ¸Ð¼ Ð¿ÑÐ¸Ð¼ÐµÑÐ¾Ð¼ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸Ñ. Ð ÑÐ°Ð±Ð¾ÑÐµ Ð¾Ð¿Ð¸ÑÐ°Ð½ ÐºÐ»Ð°ÑÑÐ¸ÑÐµÑÐºÐ¸Ð¹ Ð¿Ð¾Ð´ÑÐ¾Ð´ Ðº ÑÐµÑÐµÐ½Ð¸Ñ Ð»Ð¸Ð½ÐµÐ¹Ð½ÑÑ Ð·Ð°Ð´Ð°Ñ Ð¸ ÐµÐ³Ð¾ Ð½ÐµÐ´Ð¾ÑÑÐ°ÑÐºÐ¸. Ð¢Ð°ÐºÐ¶Ðµ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½ ÑÑÐ°Ð²Ð½Ð¸ÑÐµÐ»ÑÐ½ÑÐ¹ Ð°Ð½Ð°Ð»Ð¸Ð· Ð´Ð°Ð½Ð½Ð¾Ð³Ð¾ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¸ ÐµÐ³Ð¾ Ð¼Ð¾Ð´Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ñ, Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÑÑÐ°Ñ Ð¸Ð·Ð±Ð°Ð²Ð¸ÑÑÑÑ Ð¾Ñ Ð½ÐµÐºÐ¾ÑÐ¾ÑÑÑ Ð½ÐµÐ´Ð¾ÑÑÐ°ÑÐºÐ¾Ð². Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÑÐ¸Ð¼Ð¿Ð»ÐµÐºÑ Ð¼ÐµÑÐ¾Ð´Ð°, Ð¾ÑÐ»Ð¸ÑÐ°ÑÑÐ¸Ð¹ÑÑ Ð¾Ñ ÐºÐ»Ð°ÑÑÐ¸ÑÐµÑÐºÐ¾Ð³Ð¾. ÐÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ð½Ð°Ñ ÑÐ¿ÐµÑÐ¸ÑÐ¸ÐºÐ°ÑÐ¸Ñ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð° Ð² Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ð¼ ÑÑÐµÐ´ÑÑÐ²Ðµ Ð¸ Ð¿ÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ñ Ð²ÑÐµ ÑÐ¸ÑÐ»ÐµÐ½Ð½ÑÐµ ÑÐºÑÐ¿ÐµÑÐ¸Ð¼ÐµÐ½ÑÑ Ð½Ð°Ð´ Ð¼ÐµÑÐ¾Ð´Ð°Ð¼Ð¸. Ð¢Ð°Ðº Ð¶Ðµ Ð¿ÑÐµÐ´ÑÑÐ°Ð²Ð»ÐµÐ½Ð° ÑÐ¿ÐµÑÐ¸ÑÐ¸ÐºÐ°ÑÐ¸Ñ Ð°Ð»ÑÑÐµÑÐ½Ð°ÑÐ¸Ð²Ð½ÑÑ ÑÐµÑÐµÐ½Ð¸Ð¹ Ð´Ð»Ñ Ð»Ð¸Ð½ÐµÐ¹Ð½ÑÑ Ð·Ð°Ð´Ð°Ñ. Ð ÐµÐ·ÑÐ»ÑÑÐ°ÑÑ Ð¿Ð¾ÐºÐ°Ð·ÑÐ²Ð°ÑÑ, ÑÑÐ¾ Ð¿ÑÐµÐ´Ð»Ð¾Ð¶ÐµÐ½Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸Ð¼ÐµÐµÑ Ð±Ð¾Ð»ÑÑÑÑ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÑ Ð¿Ð¾ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ñ Ñ Ð¾Ð±ÑÑÐ½ÑÐ¼ Ð¸ Ð¼Ð¾Ð´Ð¸ÑÐ¸ÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð½ÑÐ¼ ÑÐ¸Ð¼Ð¿Ð»ÐµÐºÑ Ð¼ÐµÑÐ¾Ð´Ð¾Ð¼, ÑÐ°Ðº ÐºÐ°Ðº Ð·Ð°ÑÑÐ°ÑÐ¸Ð²Ð°ÐµÑ Ð¼ÐµÐ½ÑÑÐµÐµ ÐºÐ¾Ð»Ð¸ÑÐµÑÑÐ²Ð¾ Ð²ÑÐµÐ¼ÐµÐ½Ð¸ Ð½Ð° ÑÐµÑÐµÐ½Ð¸Ðµ Ð·Ð°Ð´Ð°Ñ Ð»Ð¸Ð½ÐµÐ¹Ð½Ð¾Ð³Ð¾ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð¾Ð´Ð¸Ð½Ð°ÐºÐ¾Ð²Ð¾Ð¹ ÑÐ»Ð¾Ð¶Ð½Ð¾ÑÑÐ¸.
description: Bachelorâs degree work is devoted to the consideration of the algorithm of the simplex method and its modification, followed by an example of use. The article describes the classic approach to solving linear problems and its disadvantages. We also conducted a comparative analysis of this algorithm and its modification, which allows us to get rid of some of the shortcomings. The algorithm of the simplex method, different from the classical one, has been developed. The presented specification is implemented in software and all numerical experiments on the methods are presented. A description of alternative solutions to linear problems is also presented. The results show that the proposed algorithm is more efficient than the traditional and modified simplex method, since it spends less time solving linear programming problems of the same complexity.