Answers are grounded in this paper and cite their sources.
We formulate and prove an optimality criterion for the disjoint bilinear programming problem and show how it can be efficiently used for solving the problem when one of the disjoint subsets has the structure of an acute-angled polytope. A class of integer and combinatorial problems that can be reduced to the disjoint bilinear programming problem with an acute-angled polytope is presented and it is shown how the considered optimality criterion can be applied.
No takes yet. Share an insight, caveat, or question.
Dmitrii Lozovanu (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: