Explicit Solutions of Nonlocal Boundary Value Problems, Containing Bitsadze-Samarskii Constraints

MSC 2010: 44A35, 35L20, 35J05, 35J25

Exact Solutions of Nonlocal Boundary Value Problems for One- and Two-Dimensional Heat Equation

Иван Хр. Димовски, Юлиан Ц. Цанков - Предложен е метод за намиране на явни решения на клас двумерни уравнения на топлопроводността с нелокални условия по пространствените променливи. Методът е основан на директно тримерно операционно смятане. Класическата дюамелова конволюция е комбинирана с две некласически конволюции за операторите ∂xx и ∂yy в една тримерна конволюция. Съответното операционно смятане използва мултипликаторни частни. Мултипликаторните частни позволяват да се продължи принципът на Дюамел за пространствените променливи и да се намерят явни решения на разглежданите гранични задачи. Общите разглеждания са приложени в случая на гранични условия от типа на Йонкин. Намерени са експлицитни решения в затворен вид.

Strong-weak Stackelberg Problems in Finite Dimensional Spaces

We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.

Decomposition of Boolean Functions – Recognizing a Good Solution by Traces

The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partition on the set of arguments of the considered Boolean function, which should be decomposable at that partition. A new fast heuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such a partition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. After that the whole sought-for partition is restored from the discovered trace by building a track initialized by the trace and leading to the solution. The results of computer experiments testify the high practical efficiency of the algorithm.