Resolving infeasibility in extremal algebras (Q1300912): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4304869 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3964346 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Residuation in fuzzy algebra and some applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on resolving infeasibility in linear programs by constraint relaxation / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0024-3795(98)10248-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2035068695 / rank | |||
Normal rank |
Latest revision as of 11:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Resolving infeasibility in extremal algebras |
scientific article |
Statements
Resolving infeasibility in extremal algebras (English)
0 references
13 March 2000
0 references
Two extremal algebras \({\mathcal B}=(B,\oplus,\otimes)\) based on a linearly ordered set \((B,\leq)\) are considered: in the maxmin algebra \(\oplus =\max\), \(\otimes=\min\), and in the maxgroup algebra \(\oplus=\max\) and \(\otimes\) is a group operation. If a system \(A\otimes x=b\) of linear equations over an extremal algebra is insolvable, then any subset of equations such that its omitting leads to a solvable subsystem is called a relieving set. The paper shows that the problem of finding the minimum cardinality relieving set is NP-complete in the maxmin algebra already for bivalent systems, while it is polynomially solvable for bivalent systems in maxgroup algebra and also NP-complete for trivalent systems.
0 references
systems of linear equations
0 references
NP-completeness
0 references
extremal algebras
0 references
maxmin algebra
0 references
maxgroup algebra
0 references
relieving set
0 references