Authors: Lozovanu Dmitrii
Keywords: Disjoint Bilinear Programming, Acute-Angled Polytope, Optimality Criterion, Boolean Linear Programming, Piecewise Linear Concave Programming,
Polynomial Time Algorithm
Abstract
We consider the disjoint bilinear
programming problem in which one of the disjoint subsets has the
structure of an acute-angled polytope. An optimality criterion for
such a problem is formulated and proved, and based on this, a
polynomial algorithm for its solving is proposed and grounded. We show that the proposed polynomial algorithm can be
efficiently used for studying and solving the boolean programming problem and the
piecewise linear concave programming problem.
Vladimir Andrunachievic Institute of Mathematics
and Computer Science, Moldovsa State University
Academiei str. 5, Chisinau, MD−2028, Moldova
E-mail:
DOI
https://doi.org/10.56415/basm.y2025.i2-3.p104
Fulltext

–
0.46 Mb