Optimal pest control problem in population dynamics

One of the main goals of the pest control is to maintain the density of the pest population in the equilibrium level below economic damages. For reaching this goal, the optimal pest control problem was divided in two parts. In the first part, the two optimal control functions were considered. These functions move the ecosystem pest-natural enemy at an equilibrium state below the economic injury level. In the second part, the one optimal control function stabilizes the ecosystem in this level, minimizing the functional that characterizes quadratic deviations of this level. The first problem was resolved through the application of the Maximum Principle of Pontryagin. The Dynamic Programming was used for the resolution of the second optimal pest control problem.

Structuralism and the Applicability of Mathematics

In this paper I argue for the view that structuralism offers the best perspective for an acceptable account of the applicability of mathematics in the empirical sciences. Structuralism, as I understand it, is the view that mathematics is not the science of a particular type of objects, but of structural properties of arbitrary domains of entities, regardless of whether they are actually existing, merely presupposed or only intentionally intended.

Design and management optimization of trickle irrigation systems using non-linear programming

A non-linear model is presented which optimizes the lay-out, as well as the design and management of trickle irrigation systems, to achieve maximum net benefit. The model consists of an objective function that maximizes profit at the farm level, subject to appropriate geometric and hydraulic constraints. It can be applied to rectangular shaped fields, with uniform or zero slope. The software used is the Gams-Minos package. The basic inputs are the crop-water-production function, the cost function and cost of system components, and design variables. The main outputs are the annual net benefit and pipe diameters and lengths. To illustrate the capability of the model, a sensitivity analysis of the annual net benefit for a citrus field is evaluated with respect to irrigated area, ground slope, micro-sprinkler discharge and shape of the field. The sensitivity analysis suggests that the greatest benefit is obtained with the smallest microsprinkler discharge, the greatest area, a square field and zero ground slope. The costs of the investment and energy are the components of the objective function that had the greatest effect in the 120 situations evaluated. (C) 1996 Academic Press Limited

Mathematics teaching life histories in the study of teachers' perceptions of change

The aim of this paper is to discuss teachers' perceptions of change in their thought and/or practice over time and their perceptions of what kind of experiences or challenges might have influenced those changes. Two mathematics teaching life histories of Brazilian teachers are examined, considering a context of curriculum development in the state of São Paulo, Brazil. Reflection on teachers' thought and practice and interest in their own development, including interest in their own learning of mathematics, seemed to be the most important internal aspects influencing change and development. Close support seemed to be the most important external aspect. The retrospective analysis put a good face on personal change and development. (C) 2000 Elsevier B.V. Ltd. All rights reserved.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

VOICES FROM THE SOUTH: DIALOGICAL RELATIONSHIPS AND COLLABORATION IN MATHEMATICS EDUCATION

This chapter presents a collaborative experience between two neighbouring countries from South America: Argentina and Brazil. Our purpose is to share a model of international collaboration that we consider to be an alternative to the classical movement of early mathematical and scientific knowledge between East and West and between North and South. We start our chapter with a general discussion about the phenomenon of globalization considering some local examples. We characterize our collaboration exploring the tensions and difficulties we faced along our own professional development at the local as well as the international level. We describe the development of our prior collaborative work that established the foundation for our international collaboration portraying the local mathematics education communities. We refer to some balances that were created among our relationships, the expansion of our collaborative network, and how this particular collaboration allows us to contribute to the regional field and inform the international one. We discuss the way that the search for balance and symmetry, or at least a complementary asymmetry in our collaborative relationships, has led us to generate a genuine and equitable collaboration.

Nonsmooth continuous-time optimization problems: Necessary conditions

We consider Lipschitz continuous-time nonlinear optimization problems and provide first-order necessary optimality conditions of both Fritz John and Karush-Kuhn-Tucker types. (C) 2001 Elsevier B.V. Ltd. All rights reserved.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Phenomenological perspective on mathematics education

This is a philosophical essay on a phenomenological way to understand and to work out Mathematics Education. Its philosophical grounding is the Husserlian work, focusing on its key word "going to the things themselves" in order to keep us away from the theoretical educational truth, took as the unique one. We assume the attitude of being on the life-world with the students and Mathematics as a field of research and practice that show and express themselves through lived experiences and through language. We assume to be in search of understanding of education, learning and Mathematics, as we take care, consciously, of what we are doing and saying in the same movement of saying and doing it.

Lagrangian heuristic for a class of the generalized assignment problems

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.