An optimality condition for linear programs
Publicationes Mathematicae Debrecen · 01.04.2026 · 108 (3-4) · 261-272
DOI: 10.5486/pmd.2026.10145 ↗Kurz gefasst
Fachartikel in der Zeitschrift Publicationes Mathematicae Debrecen, online erschienen am 01.04.2026. Verfasst von Mihaly Bessenyei und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Motivated by the well-known graphical method, we give a geometric characterization of optimal linear programs. Our condition and approach rely on the tools of convex analysis. Among the applications, we present the strong duality theorem and revisit Farkas' lemma, as well. Although the auxiliary tools are well-known or follow from highly nontrivial results, we present their (independent) proof in order to keep the paper self-contained.
Zitieren
APA
Bessenyei, M., & Toth, N. (2026). An optimality condition for linear programs. Publicationes Mathematicae Debrecen, 108(3-4), 261-272. https://doi.org/10.5486/pmd.2026.10145
Vancouver
Bessenyei M, Toth N. An optimality condition for linear programs. Publicationes Mathematicae Debrecen. 2026;108(3-4):261-272. doi:10.5486/pmd.2026.10145
BibTeX
@article{Bessenyei2026,
author = {Bessenyei, Mihaly and Toth, Norbert},
title = {An optimality condition for linear programs},
journal = {Publicationes Mathematicae Debrecen},
year = {2026},
volume = {108},
number = {3-4},
pages = {261--272},
doi = {10.5486/pmd.2026.10145}
}
EUVIMED