Numerical solution of bilinear programming problems
From MaRDI portal
Recommendations
Cited in
(20)- A new reformulation-linearization technique for bilinear programming problems
- Numerical analysis of algorithms for solving bicriteria discrete programming problems
- Generation of disjointly constrained bilinear programming test problems
- On computational search for optimistic solutions in bilevel problems
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- Numerical search for global solutions in problems of non-symmetric bilinear separability
- scientific article; zbMATH DE number 4209912 (Why is no real title available?)
- A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables
- scientific article; zbMATH DE number 4061001 (Why is no real title available?)
- scientific article; zbMATH DE number 2059740 (Why is no real title available?)
- scientific article; zbMATH DE number 1461826 (Why is no real title available?)
- OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
- On a solving bilevel d.c.-convex optimization problems
- Global search for bilevel optimization with quadratic data
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Parametrical approach for bilinear programming and its application for solving integer and combinatorial optimization problems
- scientific article; zbMATH DE number 2196458 (Why is no real title available?)
- On computational search for Nash equilibrium in hexamatrix games
- Mixed-integer bilinear programming problems
This page was built for publication: Numerical solution of bilinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499907)
