This paper studies the sum-of-ratios version of the classical minimum spanning tree problem. We describe a branch-and-bound algorithm for solving the general version of the problem based on its image space representation. The suggested approach specifically addresses the difficulties arising in...

The selection of appropriate radiation incidence directions in radiation therapy treatment planning is important for the quality of the treatment plan, both for appropriate tumor coverage and for better organ sparing. The objective of this paper is to discuss the benefits of using radial basis...

Multiple objectives and dynamics characterize many sequential decision problems. In the paper we consider returns in partially ordered criteria space as a way of generalization of single criterion dynamic programming models to multiobjective case. In our problem evaluations of alternatives with...

This paper discusses a power-based transformation technique that is especially useful when solving polynomial optimization problems, frequently occurring in science and engineering. The polynomial nonlinear problem is primarily transformed into a suitable reformulated problem containing new sets...

For reducing the energy consumption of the Mobile Station in mobile Broadband Wireless Access networks, IEEE 802.16 offers three kinds of sleep mode operations called power saving classes type I, type II and type III. In order to investigate mathematically the inherent relationships between the...

We study the exact null controllability for the abstract evolution equations in Hilbert spaces. Assuming the exact null controllability of the corresponding linearized equation we obtain sufficient conditions for the exact null controllability of the semilinear evolution equation. The results we...

In this paper, we study the system of strong vector quasi-equilibrium problems without assuming that the dual of the ordering cone has a weak* compact base. We show the existence and essential components of solution set for system of strong vector quasi-equilibrium problems by defining the...

In this paper, we are concerned with a set-valued fractional extremal programming problem under inclusion constraints. Our approach consists of using the extremal principle (an approach initiated by Mordukhovich, which does not involve any convex approximations and convex separation arguments)...

It has been observed that the Handelman’s certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a...

We consider the 1D Expected Improvement optimization based on Gaussian processes having spectral densities converging to zero faster than exponentially. We give examples of problems where the optimization trajectory is not dense in the design space. In particular, we prove that for Gaussian...