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...
Saved in:
| 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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) -
Solving Linear Volterra – Fredholm Integral Equation of the Second Type Using Linear Programming Method
by: Muna Mansoor Mustafaf
Published: (2020-03-01) -
ON SOME MODELS OF LINEAR OPTIMIZATION WITH APPLICATIONS
by: CĂTĂLIN-ILIE MITRAN
Published: (2015-10-01) -
MATHEMATICAL ECONOMIC MODEL OF PRODUCTION BUDGET OPTIMIZATION AS MARKETING CONSTITUENT
by: Alla V. Nemova
Published: (2011-07-01) -
Kaczmarz-Type Methods for Solving Matrix Equation <i>AXB</i> = <i>C</i>
by: Wei Zheng, et al.
Published: (2025-05-01)