OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS

DOI10.15807/JORSJ.38.230MaRDI QIDQ4860014zbMATH OpenOpenAlexFDO

Authors Yasutoshi Yajima, Hiroshi Konno

Publication date 14 January 1996

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.38.230

zbMATH Keywords

\(\varepsilon\)-optimal solutionlower rank bilinear programmingouter approximation algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• Efficient algorithms for solving rank two and rank three bilinear programming problems
• A linear programming approach to solving bilinear programmes
• Numerical solution of bilinear programming problems
• scientific article; zbMATH DE number 2059740
• A new reformulation-linearization technique for bilinear programming problems

Cited in

(6)

• Efficient algorithms for solving rank two and rank three bilinear programming problems
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
• On the use of optimization models for portfolio selection: A review and some computational results
• Combinatorial optimization with interaction costs: complexity and solvable cases
• scientific article; zbMATH DE number 2059740 (Why is no real title available?)

This page was built for publication: OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS

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