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.

GnRH agonist versus GnRH antagonist in poor ovarian responders: A meta-analysis

The aim of this meta-analysis was to compare the efficacy of gonadotrophin antagonist (GnRH-ant) versus GnRH agonist (GnRHa) as coadjuvant therapy for ovarian stimulation in poor ovarian responders in IVF/intracytoplasmic sperm injection cycles. Search strategies included on-line surveys of databases such as MEDLINE, EMBASE and others. A fixed effects model was used for odds ratio (OR) and effect size (weighted mean difference, WMD). Six trials fulfilled the inclusion criteria (randomized controlled trials). There was no difference between GnRH-ant and GnRHa (long and flare-up protocols) with respect to cycle cancellation rate, number of mature oocytes and clinical pregnancy rate per cycle initiated, per oocyte retrieval and per embryo transfer. When the mete-analysis was applied to the two trials that had used GnRH-ant versus long protocols of GnRHa, a significantly higher number of retrieved oocytes was observed in the GnRH-ant protocols [P = 0.018; WMD: 1.12 (0.18, 2.05)]. However, when the meta-analysis was applied to the four trials that had used GnRH-ant versus flare-up protocols, a significantly higher number of retrieved oocytes (P = 0.032; WMD: -0.51, 95% CI -0.99, -0.04) was observed in the GnRHa protocols. Nevertheless, additional randomized controlled trials with better planning are needed to confirm these results.

Recombinant LH supplementation to recombinant FSH during induced ovarian stimulation in the GnRH-antagonist protocol: A meta-analysis

This study aims to compare the efficacy of recombinant LH (rLH) supplementation for ovarian stimulation in gonadotrophin-releasing hormone-antagonist protocol for IVF/intracytoplasmic sperm injection cycles. Search strategies included online surveys of databases. The fixed effects model was used for odds ratio (OR) and effect size (weighted mean difference, WMD). Five trials fulfilled the inclusion criteria. When the meta-analysis was carried out, advantages were observed for the LH supplementation protocol with respect to higher serum oestradiol concentrations on the day of human chorionic gonadotrophin administration (P < 0.0001; WMD: 514, 95% CI 368, 660) and higher number of mature oocytes (P = 0.0098; WMD: 0.88, 95% CI 0.21, 1.54). However, these differences were not observed in the total amount of recombinant FSH (rFSH) administered, days of stimulation, number of oocytes retrieved, the clinical pregnancy rate per oocyte retrieval, the implantation rate and miscarriage rate. This result demonstrates that the association of rLH with rFSH may prevent any decrease in oestradiol after antagonist administration and that a significantly higher number of mature oocytes was available for laboratory work. Nevertheless, it failed to show any statistically significant difference in clinically significant end-points in IVF (implantation and pregnancy rates). Additional randomized controlled trials are needed to confirm these results further. © 2007 Published by Reproductive Healthcare Ltd.

A development process proposal for the ERP5 system

Modeling ERP software means capturing the information necessary for supporting enterprise management. This modeling process goes down through different abstraction layers, from enterprise modeling to code generation. Thus ERP is the kind of system where enterprise engineering undoubtedly has, or should have, a strong influence. For the case of Free/Open Source ERP, the lack of proper modeling methods and tools can jeopardize the advantage brought by source code availability. Therefore, the aim of this paper is to present a development process proposal for the Open Source ERP5 system. The proposed development process aims to cover different abstraction levels, taking into account well established standards and common practices, as well as platform issues. Its main goal is to provide an adaptable meta-process to ERP5 adopters. © 2006 IEEE.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.

Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: A comparison study

This chapter studies a two-level production planning problem where, on each level, a lot sizing and scheduling problem with parallel machines, capacity constraints and sequence-dependent setup costs and times must be solved. The problem can be found in soft drink companies where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. Models and solution approaches proposed so far are surveyed and conceptually compared. Two different approaches have been selected to perform a series of computational comparisons: an evolutionary technique comprising a genetic algorithm and its memetic version, and a decomposition and relaxation approach. © 2008 Springer-Verlag Berlin Heidelberg.

Meta-heuristic approaches for a soft drink industry problem

The present paper evaluates meta-heuristic approaches to solve a soft drink industry problem. This problem is motivated by a real situation found in soft drink companies, where the lot sizing and scheduling of raw materials in tanks and products in lines must be simultaneously determined. Tabu search, threshold accepting and genetic algorithms are used as procedures to solve the problem at hand. The methods are evaluated with a set of instance already available for this problem. This paper also proposes a new set of complex instances. The computational results comparing these approaches are reported. © 2008 IEEE.

Correlação entre a taxa de fertilização e o fuso meiótico em oócitos humanos: Uma meta-análise

Objective: To investigate the relationship between the presence of meiotic spindle in human oocytes and fertilization rates in ICSI cycles. Methods: Search strategies included online surveys of databases from 1990 to 2008. Nine trials fulfilled the inclusion criteria Results: According to the meta-analysis, the results showed statistically significant higher fertilization rate (p<0.0001) when the meiotic spindle was viewed than when it was not. There was heterogeneity in this comparison. Conclusion: The presence of a birefringent meiotic spindle in human oocytes can predict a higher fertilization rate. This observation has clinical relevance mainly in countries where there is a legal limit on the number of oocytes to be fertilized. Copyright - SBRA - Sociedade Brasileira de Reprodução Assistida.

Progresos en la reducción de la pobreza extrema en América Latina: dimensiones y políticas para el análisis de la primera meta del milenio

Incluye Bibliografía