Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

Dynamic Strategic Pricing and Speed of Diffusion

Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

Analysis of end point vibrations of a two-link manipulator by integrated CAD/CAE procedures

In this work, the effect of flexibility on the trajectory of a planar two-link manipulator is studied using integrated computer-aided design/analysis (CAD/CAE) procedures. The solid models and finite element models of the parts of the manipulator are created by using the CAD/CAE software I-DEAS. The assembly is defined, and knowing the payload and the end point trajectory, the velocities and accelerations of the parts, joint forces and driving torques are calculated using the rigid body dynamics. All the time dependent nodal forces acting on the parts including distributed gravity and inertia forces are created in files with the I-DEAS program file format. The finite element vibration analysis of the parts is performed by I-DEAS. The end point vibrations and the deviations from the rigid-body trajectory are analyzed for different types of end point acceleration curves. A circular trajectory is considered as an example. It is observed that the precision of the manipulator can be increased by testing different end point acceleration curves without changing the trajectory and the duration of the end point work. The procedure explained in this work can be used for this purpose successfully.     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

The evolution of a truncated gaussian probability density through time—modelling animal liveweights after selection

The form of the probability density derived from the evolution in time of a previously truncated frequency distribution of animal Liveweights is of interest in animal husbandry. Truncated frequency distributions arise when the heavier animals are sold for slaughter and the lighter animals retained. The demands of modern quality assurance schemes require that, given information on animal growth, the farmer is able to estimate the number of animals that would meet the specifications at some time in the future after truncation. Assuming that animal growth can be described by a linear stochastic differential equation, we derive an explicit expression for the probability density of animal Liveweights at any time after the truncation of an initial Gaussian density. It is shown that this probability density converges rapidly to a Gaussian density, so that after about 20 days of typical growth rates for lambs, the resulting density is practically indistinguishable from Gaussian.