RO  EN
IMI/Publicaţii/BASM/Ediţii/BASM n1(104)-n2(105), 2024/

An optimality criterion for disjoint bilinear programming and its application to the problem with an acute-angled polytope for a disjoint subset

Authors: Lozovanu Dmitrii
Keywords: Disjoint Bilinear Programming, Boolean Linear Programming, Resource Allocation Problem, Acute Angle Polytope, Optimality Criterion

Abstract

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.

Vladimir Andrunachievic Institute of Mathematics
and Computer Science
Academiei str. 5, Chisinau, MD−2028, Moldova
E-mail:

DOI

https://doi.org/10.56415/basm.y2024.i1-2.p109

Fulltext

Adobe PDF document0.35 Mb