arbiter
JournalsAccount

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Kei Kimura & Kazuhisa Makino

Annals of Operations Research2026https://doi.org/10.1007/s10479-026-07064-6article
AJG 3ABDC A
Weight
0.50

Abstract

Linear programming (LP) problems with gainfree Leontief substitution systems have been intensively studied in economics and operations research, and include the feasibility problem of a class of Horn systems, which arises in, e.g., polyhedral combinatorics and logic. This subclass of LP problems admits a strongly polynomial time algorithm, where devising such an algorithm for general LP problems is one of the major theoretical open questions in mathematical optimization and computer science. Recently, much attention has been paid to devising certifying algorithms in software engineering, since those algorithms enable one to confirm the correctness of outputs of programs with simple computations. Devising a combinatorial certifying algorithm for the feasibility for a fundamental class of Horn systems remains open for almost a decade. In this paper, we provide the first combinatorial (and strongly polynomial time) certifying algorithm for LP problems with gainfree Leontief substitution systems. As a by-product, we resolve the open question on the feasibility for the class of Horn systems.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1007/s10479-026-07064-6

Or copy a formatted citation

@article{kei2026,
  title        = {{A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems}},
  author       = {Kei Kimura & Kazuhisa Makino},
  journal      = {Annals of Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s10479-026-07064-6},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.