The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Computational Difficulties of Bilevel Linear Programming
Open accessAbstract
We show, using small examples, that two algorithms previously published for the Bilevel Linear Programming problem (BLP) may fail to find the optimal solution and thus must be considered to be heuristics. A proof is given that solving BLP problems is NP-hard, which makes it unlikely that there is a good, exact algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Representation and Economic Interpretation of a Two-Level Programming Problem
Fortuny‐Amat, J., & McCarl, B. A. (1981) · Journal of the Operational Research Society · doi:10.1057/jors.1981.156 · Cited by 1,174
The Simplex Method for Quadratic Programming
Wolfe, P. (1960) · Econometrica · doi:10.2307/1905320 · Cited by 503
The polynomial hierarchy and a simple model for competitive analysis
Jeroslow, R. G. (1985) · Mathematical Programming · doi:10.1007/bf01586088 · Cited by 425
A linear two-level programming problem
Candler, W. V., & Townsley, R. J. (1982) · Computers & Operations Research · doi:10.1016/0305-0548(82)90006-5 · Cited by 392
LeBlanc, L. J., & Boyce, D. E. (1986) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(86)90021-4 · Cited by 186
Cited by
An overview of bilevel optimization
Colson, B., Marcotte, P., & Savard, G. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0176-2 · Cited by 1,409
Digital twin-driven rapid individualised designing of automated flow-shop manufacturing system
Liu, Q., Zhang, H., Leng, J., & Chen, X. (2019) · International Journal of Production Research · doi:10.1080/00207543.2018.1471243 · Cited by 370
Metadata
- Authors
- Ben-Ayed, O., & Blair, C. E.
- Venue
- Operations Research
- Published
- 1990-06
- Volume
- 38
- Issue
- 3
- Pages
- 556-560
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2095818975
- Cited by
- 413
- References
- 5
- FWCI
- 2.93
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational Difficulties of Bilevel Linear Programming. https://app.cochat.ai/papers/10.1287/opre.38.3.556
- The paper
- Ben-Ayed, O., & Blair, C. E. (1990). Computational Difficulties of Bilevel Linear Programming. Operations Research. https://doi.org/10.1287/opre.38.3.556
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.