Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
Optimization and Control
2025-02-13 v1
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 algorithm can be efficiently used for studying and solving the boolean linear programming problem and the piecewise linear concave programming problem.
Cite
@article{arxiv.2502.08286,
title = {Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset},
author = {Dmitrii Lozovanu},
journal= {arXiv preprint arXiv:2502.08286},
year = {2025}
}