A method of solving bilinear minimax problems

DOI10.1016/0041-5553(85)90171-5MaRDI QIDQ3734193zbMATH OpenOpenAlexFDO

Authors B. D. Dujsebaev

Publication date 1986

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(85)90171-5

zbMATH Keywords

branch and bound methodbilinear minimax problems

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05)

Cited in

(2)

• A simple bilinear optimization problem
• Bilinear minimax problems with linear constraints: Theory and numerical experiment

This page was built for publication: A method of solving bilinear minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734193)