Algorithm for solving the problem of the first phase in a game problem with arbitrary situations

DOI10.26516/1997-7670.2024.48.3MaRDI QIDQ6572949zbMATH OpenFDO

Authors Akmal Ravshanovich Mamatov

Publication date 16 July 2024

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmsupportdual problemgame problemfirst phase problem

Mathematics Subject Classification ID

2-person games (91A05)

Recommendations

• An algorithm for solving a linear max-min problem with coupled variables
• scientific article; zbMATH DE number 3970563
• scientific article; zbMATH DE number 569892
• Publication:4723587

Cites work

• scientific article; zbMATH DE number 3930714 (Why is no real title available?)
• scientific article; zbMATH DE number 3735539 (Why is no real title available?)
• scientific article; zbMATH DE number 3511909 (Why is no real title available?)
• A branch and bound-based algorithm for the weak linear bilevel programming problems
• A linear max—min problem
• A new variant of penalty method for weak linear bilevel programming problems
• A solution approach to the weak linear bilevel programming problems
• An exact penalty method for weak linear bilevel programming problem
• High-order necessary optimality conditions in a linear maxmin problem with coupled variables
• On theory of the duality linear maximin problems with connected variables

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)