OF THE BASIC DECISIONS OF THE METHOD OF SUCCESSIVE IMPROVEMENTS

Alexandr Nikolayevich Shevtsov, Kuanishbaevna Tangirbergenova Assem, Gymnasium №45 named after B. Momyshuly, Taraz, Kazakhstan

2013

Closed access Metadata (CSL-JSON)

DOI 10.15863/tas.2013.10.6.2

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The article considers some aspects of implementation of computer method of basis solutions. Key words: the simplex method basis, Delphi.О БАЗИСНЫХ РЕШЕНИЯХ МЕТОДА ПОСЛЕДОВАТЕЛЬНЫХ УЛУЧШЕНИЙ.В статье рассматриваются некоторые аспекты компьютерной реализации метода базисных решений.Ключевые слова: симплекс метод, базис, Дельфи.Для изучения выпуклых множеств S, рассмотривают -«крайные точки» [1]. Условие существования крайней точки.Если из того, чтоРассмотрим карйние точки множества допустимых решений с стандартной задачи линейного программирования.