A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations
This article describes an algorithm for obtaining a non-negative basic solution of a system of linear algebraic equations. This problem, which undoubtedly has an independent interest, in particular, is the most time-consuming part of the famous simplex method for solving linear programming problems....
Saved in:
| Main Author: | Gleb D. Stepanov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2021-10-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1524 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
by: Gleb D. Stepanov
Published: (2021-12-01) -
On the Equality <i>A</i> = <i>A</i><sub>1</sub><i>A</i><sub>2</sub> for Linear Relations
by: Marcel Roman, et al.
Published: (2025-03-01) -
Introduction Linear Algebra /
by: Strang, Gilbert
Published: (2016) -
A modulus-based modified multivariate spectral gradient projection method for solving the horizontal linear complementarity problem
by: Ting Lin, et al.
Published: (2025-02-01) -
The Modified Quadrature Method for solving Volterra Linear Integral Equations
by: Baghdad Science Journal
Published: (2014-12-01)