Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Design of microirrigation systems in sloping lands using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.

Artificial immune systems applied to optimal capacitor placement in radial distribution networks

The capacitor placement problem for radial distribution networks aims to determine capacitor types, sizes, locations and control scheme. This is a combinatorial problem that can be formulated as a mixed integer nonlinear program. The paper presents an algorithm inspired in artificial immune systems and developed for this specific problem. A good performance was obtained through experimental tests applied to known systems. © 2006 IEEE.

Potential scenarios for Internet use in the mathematics classroom

Research on the influence of multiple representations in mathematics education gained new momentum when personal computers and software started to become available in the mid-1980s. It became much easier for students who were not fond of algebraic representations to work with concepts such as function using graphs or tables. Research on how students use such software showed that they shaped the tools to their own needs, resulting in an intershaping relationship in which tools shape the way students know at the same time the students shape the tools and influence the design of the next generation of tools. This kind of research led to the theoretical perspective presented in this paper: knowledge is constructed by collectives of humans-with-media. In this paper, I will discuss how media have shaped the notions of problem and knowledge, and a parallel will be developed between the way that software has brought new possibilities to mathematics education and the changes that the Internet may bring to mathematics education. This paper is, therefore, a discussion about the future of mathematics education. Potential scenarios for the future of mathematics education, if the Internet becomes accepted in the classroom, will be discussed. © FIZ Karlsruhe 2009.

Collectives of humans-with-media in mathematics education: Notebooks, blackboards, calculators, computers and ... notebooks throughout 100 years of ICMI

The main aim of this study was to present evidence of the ways in which different media have conditioned and dramatically reorganized education, in general, and mathematics education, in particular. After an introduction of the theme, we discuss the epistemological perspective that provides the foundation for our analysis: the notion of humans-with-media. Then, we briefly illustrate how the medium is related to the scientific production of mathematical knowledge. We take a detour into the world of art to examine how devices and instruments have historically been associated with the production of mathematical knowledge. Then, we review studies on the history of education to show how traditional media were introduced into schools and have influenced education. In particular, we examine how devices such as blackboards and notebooks, which were novelties a 100 years ago, came to be accepted in schools and the mathematical activities that were promoted with their use. Finally, we discuss how information technology has changed education and how the Internet may have an impact on mathematics education comparable to that of the notebook over a century ago. © FIZ Karlsruhe 2009.