Numerical solution of bilinear programming problems

DOI10.1134/S0965542508020061zbMath1224.90171MaRDI QIDQ3499907

Andrey Vasil'evich Orlov

Publication date: 3 June 2008

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

zbMATH Keywords

stopping criteriacritical pointlocal searchbilinear programmingglobal searchnon-convex optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (7)

On computational search for optimistic solutions in bilevel problems ⋮ On computational search for Nash equilibrium in hexamatrix games ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ Hybrid global search algorithm with genetic blocks for solving hexamatrix games ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

This page was built for publication: Numerical solution of bilinear programming problems