Experiments with Active-Set LP Algorithms Allowing Basis Deficiency
An interesting question for linear programming (LP) algorithms is how to deal with solutions in which the number of nonzero variables is less than the number of rows of the matrix in standard form. An approach is that of basis deficiency-allowing (BDA) simplex variations, which work with a subset of...
Main Authors: | Pablo Guerrero-García, Eligius M. T. Hendrix |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-12-01
|
Series: | Computers |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-431X/12/1/3 |
Similar Items
-
A uniform allowance matching method for point cloud based on the edge extraction under de-shaping center
by: Jingyu Sun, et al.
Published: (2022-12-01) -
Direct methods for sparse linear systems /
by: 237171 Davis, Timothy A.
Published: (2006) -
Accelerating Revised Simplex Method Using GPU-Based Basis Update
by: Usman Ali Shah, et al.
Published: (2020-01-01) -
The Avriel-Ben-Tal algebraic operations approach for a short version proof of the Karush-Kuhn-Tucker optimality conditions
by: Cornaciu Veronica, et al.
Published: (2017-07-01) -
Early Houses Designed By Farkas Molnár and Semih Rüstem: An Examination Based on Bauhaus and KURI Principles
by: Duygu Saban
Published: (2018-03-01)