Translate 
Chat Pdf 
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
