An integer linear programming approach for bilinear integer programming

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.

Um modelo de projeto de layout para ambientes job shop com alta variedade de peças baseado nos conceitos da produção enxuta

Segundo Canem e Williamson (1998), o planejamento do layout é importante, pois normalmente representa os maiores e mais caros recursos da organização. Além disso, a localização e disposição física dos equipamentos no chão de fábrica têm impacto em diversos fatores como nível de estoque em processo, tamanho dos lotes de transferência, dificuldade no gerenciamento das atividades, movimentação de pessoas e produtos, entre outros. Portanto, o estudo de conceitos de arranjo físico e o desenvolvimento de modelos de projeto do layout, que visem a otimização dos recursos de produção, são de vital importância na busca pela melhoria dos sistemas produtivos. Neste contexto, este artigo apresenta um novo modelo de projeto de layout, para ambientes job shop com ampla variedade de peças. O modelo foi desenvolvido durante uma pesquisa de doutorado e foi aplicado em algumas empresas do setor metal mecânico. Os resultados obtidos comprovaram a eficiência do modelo projetado. O objetivo do modelo consiste em conduzir a equipe de projeto de layout a desenvolver alternativas de arranjo físico que estejam em consonância com conceitos e princípios da filosofia de produção enxuta. Vale ressaltar novamente que o modelo foi desenvolvido para ambientes com alta variedade de peças, ambientes esses em que, devido à dificuldade em se projetar o arranjo físico, as empresas terminam por adotar o layout funcional, conceito esse de arranjo físico que apresenta sérios problemas como excesso de transporte, altos níveis de estoques em processo, etc.

Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented.

Integrated pulp and paper mill planning and scheduling

This article describes a real-world production planning and scheduling problem occurring at an integrated pulp and paper mill (P&P) which manufactures paper for cardboard out of produced pulp. During the cooking of wood chips in the digester, two by-products are produced: the pulp itself (virgin fibers) and the waste stream known as black liquor. The former is then mixed with recycled fibers and processed in a paper machine. Here, due to significant sequence-dependent setups in paper type changeovers, sizing and sequencing of lots have to be made simultaneously in order to efficiently use capacity. The latter is converted into electrical energy using a set of evaporators, recovery boilers and counter-pressure turbines. The planning challenge is then to synchronize the material flow as it moves through the pulp and paper mills, and energy plant, maximizing customer demand (as backlogging is allowed), and minimizing operation costs. Due to the intensive capital feature of P&P, the output of the digester must be maximized. As the production bottleneck is not fixed, to tackle this problem we propose a new model that integrates the critical production units associated to the pulp and paper mills, and energy plant for the first time. Simple stochastic mixed integer programming based local search heuristics are developed to obtain good feasible solutions for the problem. The benefits of integrating the three stages are discussed. The proposed approaches are tested on real-world data. Our work may help P&P companies to increase their competitiveness and reactiveness in dealing with demand pattern oscillations. (C) 2012 Elsevier Ltd. All rights reserved.

MATHEMATICAL MODELS AND POLYHEDRAL STUDIES FOR INTEGRAL SHEET METAL DESIGN

We deal with the optimization of the production of branched sheet metal products. New forming techniques for sheet metal give rise to a wide variety of possible profiles and possible ways of production. In particular, we show how the problem of producing a given profile geometry can be modeled as a discrete optimization problem. We provide a theoretical analysis of the model in order to improve its solution time. In this context we give the complete convex hull description of some substructures of the underlying polyhedron. Moreover, we introduce a new class of facet-defining inequalities that represent connectivity constraints for the profile and show how these inequalities can be separated in polynomial time. Finally, we present numerical results for various test instances, both real-world and academic examples.

Accelerating benders decomposition with heuristicmaster problem solutions

In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.

Programming peculiarities in two cochlear implant users with superficial siderosis of the central nervous system

To report the audiological outcomes of cochlear implantation in two patients with severe to profound sensorineural hearing loss secondary to superficial siderosis of the CNS and discuss some programming peculiarities that were found in these cases. Retrospective review. Data concerning clinical presentation, diagnosis and audiological assessment pre- and post-implantation were collected of two patients with superficial siderosis of the CNS. Both patients showed good hearing thresholds but variable speech perception outcomes. One patient did not achieve open-set speech recognition, but the other achieved 70% speech recognition in quiet. Electrical compound action potentials could not be elicited in either patient. Map parameters showed the need for increased charge. Electrode impedances showed high longitudinal variability. The implants were fairly beneficial in restoring hearing and improving communication abilities although many reprogramming sessions have been required. The hurdle in programming was the need of frequent adjustments due to the physiologic variations in electrical discharges and neural conduction, besides the changes in the impedances. Patients diagnosed with superficial siderosis may achieve limited results in speech perception scores due to both cochlear and retrocochlear reasons. Careful counseling about the results must be given to the patients and their families before the cochlear implantation indication.

A relaxed constant positive linear dependence constraint qualification and applications

In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification by Minchenko and Stakhovski that was called RCRCQ. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and that it asserts the validity of an error bound. We also provide proofs and counter-examples that show the relations of RCRCQ and RCPLD with other known constraint qualifications. In particular, RCPLD is strictly weaker than CPLD and RCRCQ, while still stronger than Abadie's constraint qualification. We also verify that the second order necessary optimality condition holds under RCRCQ.

The effect of a Lucia jig for 30 minutes on neuromuscular re-programming, in normal subjects

The Lucia jig is a technique that promotes neuromuscular reprogramming of the masticatory system and allows the stabilization of the mandible without the interference of dental contacts, maintaining the mandible position in harmonic condition with the musculature in normal subjects or in patients with temporomandibular dysfunction (TMD). This study aimed to electromyographically analyze the activity (RMS) of the masseter and temporal muscles in normal subjects (control group) during the use of an anterior programming device, the Lucia jig, in place for 0, 5, 10, 20 and 30 minutes to demonstrate its effect on the stomatognathic system. Forty-two healthy dentate individuals (aged 21 to 40 years) with normal occlusion and without parafunctional habits or ternporomandibular dysfunction (RDC/TMD) were evaluated on the basis of the electromyographic activity of the masseter and temporal muscles before placement of a neuromuscular re-programming device, the Lucia jig, on the upper central incisors. There were no statistically significant differences (p < 0.05) in the electromyographic activity of the masticatory muscles in the different time periods. The Lucia jig changed the electromyographic activity by promoting a neuromuscular reprogramming. In most of the time periods, it decreased the activation of the masticatory muscles, showing that this device has wide applicability in dentistry. The use of a Lucia jig over 0, 5, 10, 15, 20 and 30 minutes did not promote any statistically significant increase in muscle activity despite differences in the data, thus showing that this intra-oral device can be used in dentistry.

Implications of maternal nutrient restriction in transgenerational programming of hypertension and endothelial dysfunction across F1-F3 offspring

Aims: An extensive variety of prenatal insults are associated with an increased incidence of metabolic and cardiovascular disorders in adult life. We previously demonstrated that maternal global nutrient restriction during pregnancy leads to increased blood pressure and endothelial dysfunction in the adult offspring. This study aimed to assess whether prenatal exposure to nutritional insult has transgenerational effects in F-2 and F-3 offspring. Main methods: For this, female Wistar rats were randomly divided into two groups on day 1 of pregnancy: a control group fed standard chow ad libitum and a restricted group fed 50% of the ad libitum intake throughout gestation. At delivery, all animals were fed a standard laboratory chow diet. At 11 weeks of age, one female and one male from each restricted litter were randomly selected and mated with rats from another restricted litters in order to generate the F-2 offspring. The same procedure produced F-3 generation. Similarly, the rats in the control group were bred for each generation. Key Findings: Our findings show that the deleterious effects of maternal nutrient restriction to which the F-0 mothers were exposed may not be limited to the male first generation. In fact, we found that elevated blood pressure, an impaired vasodilatory response to acetylcholine and alterations in NO production were all transferred to the subsequent males from F-2 and F-3 generations. Significance: Our data show that global nutrient restriction during pregnancy results in a specific phenotype that can be passed transgenerationally to a second and third generation. (c) 2012 Elsevier Inc. All rights reserved.

Cochlear Implantation Via the Middle Fossa Approach: Surgical and Programming Considerations

Objectives: To report the results of cochlear implantation via the middle fossa approach in 4 patients, discuss the complications, and present a detailed description of the programming specifications in these cases. Study Design: Retrospective case review. Setting: Tertiary-care referral center with a well-established cochlear implant program. Patients: Four patients with bilateral canal wall down mastoid cavities who underwent the middle fossa approach for cochlear implantation. Interventions: Cochlear implantation and subsequent rehabilitation. A middle fossa approach with cochleostomy was successfully performed on the most superficial part of the apical turn in 4 patients. A Nucleus 24 cochlear implant system was used in 3 patients and a MED-EL Sonata Medium device in 1 patient. The single electrode array was inserted through a cochleostomy from the cochlear apex and occupied the apical, middle, and basal turns. Telemetry and intraoperative impedance recordings were performed at the end of surgery. A CT scan of the temporal bones was performed to document electrode insertion for all of the patients. Main Outcome Measures: Complications, hearing thresholds, and speech perception outcomes were evaluated. Results: Neural response telemetry showed present responses in all but 1 patient, who demonstrated facial nerve stimulation during the test. Open-set speech perception varied from 30% to 100%, despite the frequency allocation order of the MAP. Conclusion: Cochlear implantation via the middle cranial fossa is a safe approach, although it is a challenging procedure, even for experienced surgeons.

TWO NEW WEAK CONSTRAINT QUALIFICATIONS AND APPLICATIONS

We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally. A major open question was to identify the exact set of gradients whose properties had to be preserved locally and that would still work as a CQ. This is done in the first new CQ, which we call the constant rank of the subspace component (CRSC) CQ. This new CQ also preserves many of the good properties of RCPLD, such as local stability and the validity of an error bound. We also introduce an even weaker CQ, called the constant positive generator (CPG), which can replace RCPLD in the analysis of the global convergence of algorithms. We close this work by extending convergence results of algorithms belonging to all the main classes of nonlinear optimization methods: sequential quadratic programming, augmented Lagrangians, interior point algorithms, and inexact restoration.