Polynomial algorithm for the disjoint bilinear programming problem with an acute [Articol]
| dc.contributor.author | Lozovanu, Dmitrii | en |
| dc.date.accessioned | 2026-06-03T08:53:15Z | |
| dc.date.issued | 2025 | |
| dc.description.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. | en |
| dc.description.sponsorship | This research was supported by the Research Program for Moldova State University for 2024 - 2027 years (subprogam 01130) and Research Project 25.80012.5007.80SE. | en |
| dc.identifier.citation | LOZOVANU, Dmitrii. Polynomial algorithm for the disjoint bilinear programming problem with an acute. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica. 2025, nr. 2-3(108-109), pp. 104-157. ISSN 1024-7696; E-ISSN 2587-4322. Disponibil: https://doi.org/10.56415/basm.y2025.i2-3.p104 | en |
| dc.identifier.issn | 1024-7696 | |
| dc.identifier.issn | 2587-4322 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/20835 | |
| dc.identifier.uri | https://doi.org/10.56415/basm.y2025.i2-3.p104 | |
| dc.language.iso | en | |
| dc.publisher | Moldova State University | en |
| dc.subject | disjoint bilinear programming | en |
| dc.subject | acute-angled polytope | en |
| dc.subject | optimality criterion | en |
| dc.subject | boolean linear programming | en |
| dc.subject | piecewise linear concave programming | en |
| dc.subject | polynomial time algorithm | en |
| dc.title | Polynomial algorithm for the disjoint bilinear programming problem with an acute [Articol] | en |
| dc.type | Article |