Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
The article considers a method for solving a linear programming problem (LPP), which requires finding the minimum or maximum of a linear functional on a set of non-negative solutions of a system of linear algebraic equations with the same unknowns. The method is obtained by improving the classical s...
Main Author: | Gleb D. Stepanov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2021-12-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/1569 |
Similar Items
-
A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations
by: Gleb D. Stepanov
Published: (2021-10-01) -
MATHEMATICAL ECONOMIC MODEL OF PRODUCTION BUDGET OPTIMIZATION AS MARKETING CONSTITUENT
by: Alla V. Nemova
Published: (2011-07-01) -
SOLUTION OF OPEN TRANSPORTATION PROBLEMS
by: S. V. Petrunin, et al.
Published: (2016-11-01) -
The efficiency comparison of solvers for sparse linear algebraic equations systems based on the BiCGStab and FGMRES methods
by: I. K. Marchevsky, et al.
Published: (2018-10-01) -
Solution of Linear Inverse Problem Using Computer Technology GrAnM
by: Z. Z. Arsanukaev, et al.
Published: (2018-09-01)