
arXiv: 2409.08119
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take "infinite values". Code: https://github.com/madvorak/duality/tree/v3.2.0
FOS: Computer and information sciences, Logic in Computer Science, Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Logic in Computer Science (cs.LO)
FOS: Computer and information sciences, Logic in Computer Science, Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Logic in Computer Science (cs.LO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
