Simplex method of linear programming problems used in the armed forces

Бесплатный доступ

The article considers the possibilities of economic and mathematical application of the simplex method, which is the most universal method for sequential improvement of the plan. The simplex method allows you to find a solution to any linear programming problem that has a solution by performing a certain number of steps, each of which is performed according to the established rules of algebraic transformations. The task is determined by the uniqueness of the final result of the activity, the difficulty of measuring it with costs, the variety of types of support (combat, material, financial, etc.) and the specifics of economic relations (the system of orders for military equipment, its payment, accounting and storage; conditions of deployment). The end result of the activities of all elements of the Force structure is an intangible represents the combat readiness of the troops to contain the aggressive intentions of a potential enemy in peacetime and to carry out fighting tasks in the event of the outbreak of the aggressive forces of war. To do this, it is necessary to improve military equipment, train and educate personnel, and therefore increase the combat readiness of the Armed Forces. This requires the expense of budgetary funds.

Еще

Simplex method, linear programming problem, universality, computer calculations, simple examples, solution methods, linear programming, solved problems, accuracy, reliability, economic results, accounting degree, properties, object consistency, real object method, model, complex systems, modern technologies, processes

Еще

Короткий адрес: https://sciup.org/142225140

IDR: 142225140   |   DOI: 10.17513/vaael.1469

Статья научная