The DOI matches its Crossref record.
Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
Open accessAbstract
Abstract Multilevel programming offers a means of studying decentralized noncooperative decision systems. Unfortunately, multilevel programming is lacking efficient algorithms due to its computational difficulties such as nonconvexity and NP-hardness. This paper will design a genetic algorithm for solving Stackelberg-Nash equilibrium of nonlinear multilevel programming with multiple followers in which there might be information exchange among the followers. As a byproduct, we obtain a means for solving classical minimax problems. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed genetic algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Theory and Practice of Uncertain Programming
Liu, B. (2009) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-89484-1 · Cited by 694
Self-citationDigital 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
Leng, J., Liu, Q., Ye, S., Jing, J., Wang, Y., Zhang, C., Zhang, D., & Chen, X. (2020) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2019.101895 · Cited by 342
Giannakoglou, K. C. (2002) · Progress in Aerospace Sciences · doi:10.1016/s0376-0421(01)00019-7 · Cited by 259
Outsourcer-supplier coordination for parts machining outsourcing under social manufacturing
Leng, J., Jiang, P., & Zheng, M. (2017) · Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture · doi:10.1177/0954405415583883 · Cited by 38
“Due to the computational difficulties such as nonconvexity and NP-hardness for solving the practical bilevel programming problems, it is not easy to verify the conditions on the convergence of solution algorithm, and thus, we usually employ the iterative(37) or computational intelligence methods such as genetic algori…”
Method
Metadata
- Authors
- Liu, B.
- Venue
- Computers & Mathematics with Applications
- Publisher
- Elsevier BV
- Published
- 1998-10
- Volume
- 36
- Issue
- 7
- Pages
- 79-89
- ISSN
- 0898-1221 (ISSN-L)
- OpenAlex
- W2009567498
- Cited by
- 166
- References
- 0
- FWCI
- 0.86
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. https://app.cochat.ai/papers/10.1016/s0898-1221(98)00174-6
- The paper
- Liu, B. (1998). Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. Computers & Mathematics with Applications. https://doi.org/10.1016/s0898-1221(98)00174-6
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.