RO EN
Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
Authors: Lozovanu Dmitrii
Keywords: Disjoint Bilinear Programming, Acute-Angled Polytope, Optimality Criterion, Boolean Linear Programming, Piecewise Linear Concave Programming, Polynomial Time Algorithm
– 0.46 Mb
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:
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.p104Fulltext
– 0.46 Mb
Contents
- Dissipative Dirac Operator on Time Scales
- On the Asymptotic Behavior of Solutions of the Cauchy Problem for a Hyperbolic Equation with Periodic Coefficients
- Global Attractors of Non-autonomous Lattice Dynamical Systems
- The relationships between common multiples of matrices over commutative Bézout domain of stable range 1.5
- Temporal Analysis of Hidden and Standard Markov Processes with Final Sequences of States
- Continuous Gromov--Hausdorff distance
- Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
- Solution of a renewal equation in population biology and epidemiology
