Algorithm for solving the problem of the first phase in a game problem with arbitrary situations
From MaRDI portal
Publication:6572949
DOI10.26516/1997-7670.2024.48.3zbMATH Open1545.91005MaRDI QIDQ6572949FDOQ6572949
Authors: Akmal Ravshanovich Mamatov
Publication date: 16 July 2024
Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A linear max—min problem
- On theory of the duality linear maximin problems with connected variables
- An exact penalty method for weak linear bilevel programming problem
- A solution approach to the weak linear bilevel programming problems
- A new variant of penalty method for weak linear bilevel programming problems
- A branch and bound-based algorithm for the weak linear bilevel programming problems
- High-order necessary optimality conditions in a linear maxmin problem with coupled variables
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Algorithm for solving the problem of the first phase in a game problem with arbitrary situations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572949)