A simplification of the proof of the maximum principle of
Pontryagin is obtained for constrained and unconstrained optimal control
problems. Two numerical methods for solving optimal control problems
with guaranteed error bounds using the maximum principle of Pontryagin
and interval analysis are derived.
We investigate the optimal harvesting strategies for McKendrick type population models. Models of this type endow the population with a continuous age structure. They consist of a partial differential equation with a boundary condition which involves an integral of the solution. We study two problems, the first concerns the yield...
Many important application problems in engineering can be formalized as nonlinear
optimization tasks. However, numerical methods for solving such problems
are brittle and do not scale well. For example, these methods depend critically
on choosing a good starting point from which to perform the optimization search.
In high-dimensional spaces, numerical...
Many different types of distributed batch scheduling systems have been developed in the last decade to take advantage of the decentralization of computers and the enormous investments that many companies and educational institutions have in desktop workstations. Based on the premise that the majority of desktop workstations are significantly underutilized,...
A basic tradeoff to consider when designing a distributed data-mining framework is the need for a compromise between the cost of communication and computation resources and the accuracy of the mining results. This is essentially a decision of whether it is more efficient to communicate all of the data to...
How can an agent generalize its knowledge to new circumstances? To learn
effectively an agent acting in a sequential decision problem must make intelligent action selection choices based on its available knowledge. This dissertation focuses on Bayesian methods of representing learned knowledge and develops novel algorithms that exploit the represented...
Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
In this research, a bi-criteria group scheduling problem is investigated in hybrid flow shop (HFS) environments, where the parallel machines in each stage are unrelated, meaning not identical. The objective of the problem is to minimize a linear combination of the total weighted completion times as a means of complying...