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.     

John Hawkes (1944-2001)

In his curriculum vitae, John Hawkes lists his research interestsas geometric measure theory, probability (Lévy processes),and potential theory (probabilistic). In fact, he made significantcontributions to all three areas, and there are strong relationshipsbetween them. He used both geometric measure theory and potentialtheory as tools for his study of the trajectories of particularLévy processes, but in many cases he needed to developthe tool before it was ready to be used. We will summarise hisresearch later, but first we discuss what is known of his lifehistory.     

Seizure warning algorithm based on optimization and nonlinear dynamics

There is growing evidence that temporal lobe seizures are preceded by a preictal transition, characterized by a gradual dynamical change from asymptomatic interictal state to seizure. We herein report the first prospective analysis of the online automated algorithm for detecting the preictal transition in ongoing EEG signals. Such, the algorithm constitutes a seizure warning system. The algorithm estimates STL_max, a measure of the order or disorder of the signal, of EEG signals recorded from individual electrode sites. The optimization techniques were employed to select critical brain electrode sites that exhibit the preictal transition for the warning of epileptic seizures. Specifically, a quadratically constrained quadratic 0-1 programming problem is formulated to identify critical electrode sites. The automated seizure warning algorithm was tested in continuous, long-term EEG recordings obtained from 5 patients with temporal lobe epilepsy. For individual patient, we use the first half of seizures to train the parameter settings, which is evaluated by ROC (Receiver Operating Characteristic) curve analysis. With the best parameter setting, the algorithm applied to all cases predicted an average of 91.7% of seizures with an average false prediction rate of 0.196 per hour. These results indicate that it may be possible to develop automated seizure warning devices for diagnostic and therapeutic purposes.Mathematics Subject Classification (1991):20E28, 20G40, 20C20     

A note on a generalized Douglas space

Periodica Mathematica Hungarica -     

Planning District‐Wide Professional Development: Insights Gained From Teachers and Students Regarding Mathematics Teaching in a Large Urban District

This paper describes the mechanism used to gain insights into the state of the art of mathematics instruction in a large urban district in order to design meaningful professional development for the teachers in the district. Surveys of close to 2,000 elementary, middle school, and high school students were collected in order to assess the instructional practices used in mathematics classes across the district. Students were questioned about the frequency of use of various instructional practices that support the meaningful learning of mathematics. These included practices such as problem solving, use of calculators and computers, group work, homework, discussions, and projects, among others. Responses were analyzed and comparisons were drawn between elementary and middle school students' responses and between middle school and high school responses. Finally, fifth‐grade student responses were compared to those of their teachers. Student responses indicated that they had fewer inquiry‐based experiences, fewer student‐to‐student interactions, and fewer opportunities to defend their answers and justify their thinking as they moved from elementary to middle school to high school. In the elementary grades students reported an overemphasis on the use of memorization of facts and procedures and sparse use of calculators. Results were interpreted and specific directions for professional development, as reported in this paper, were drawn from these data. The paper illustrates how student surveys can inform the design of professional development experiences for the teachers in a district.     

A flexible and generic approach to dynamic modelling of supply chains

In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.     

Calculating scale elasticity in DEA models

In the data envelopment analysis (DEA) efficiency literature, qualitative characterizations of returns to scale (increasing, constant, or decreasing) are most common. In economics it is standard to use the scale elasticity as a quantification of scale properties for a production function representing efficient operations. Our contributions are to review DEA practices, apply the concept of scale elasticity from economic multi-output production theory to DEA piecewise linear frontier production functions, and develop formulas for scale elasticity for radial projections of inefficient observations in the relative interior of fully dimensional facets. The formulas are applied to both constructed and real data and show the differences between scale elasticities for the two valid projections (input and output orientations). Instead of getting qualitative measures of returns to scale only as was done earlier in the DEA literature, we now get a quantitative range of scale elasticity values providing more information to policy-makers.     

Minisum collection depots location problem with multiple facilities on a network

We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported.