Qualitative assessment of stock prices listed on the Sao Paulo stock exchange: An approach from the perspective of homogeneity analysis

The stock market suffers uncertain relations throughout the entire negotiation process, with different variables exerting direct and indirect influence on stock prices. This study focuses on the analysis of certain aspects that may influence these values offered by the capital market, based on the Brazil Index of the Sao Paulo Stock Exchange (Bovespa), which selects 100 stocks among the most traded on Bovespa in terms of number of trades and financial volume. The selected variables are characterized by the companies` activity area and the business volume in the month of data collection, i.e. April/2007. This article proposes an analysis that joins the accounting view of the stock price variables that can be influenced with the use of multivariate qualitative data analysis. Data were explored through Correspondence Analysis (Anacor) and Homogeneity Analysis (Homals). According to the research, the selected variables are associated with the values presented by the stocks, which become an internal control instrument and a decision-making tool when it comes to choosing investments.

Merluccius hubbsi (Teleostei: Merlucciidae): stock identification based on reproductive biology in the south-southeast brazilian region

The Argentine hake, Merluccius hubbsi, a demersal-pelagic species found from Rio de Janeiro, Brazil to the Tierra del Fuego, Argentina, has become an important target of the Brazilian bottom-trawler fleet since 2001. Earlier studies focusing on the species have suggested that more than one stock might occur off the Brazilian coast, in accordance with environmental features. In order to evaluate this hypothesis, fish were collected from four different areas in the Brazilian waters in which the hake is distributed, during the summers and winters of 1996-2001 and 2004, the females being used to analyze and compare spatial-temporal variations in ovarian maturation. Gonad indexes were also applied for the same purpose. Results indicate a north-south spawning gradient occurring as from summer at around 21°S to winter near 34°S, leading to the identification of two distinct stocks: one located between 21°S and 29°S (Southeastern stock) and the other between 29°S and 34°S (Southern stock), this latter shared with Uruguay and Argentina. Brazilian stocks present clear signs of overexploitation, the situation calling for an urgent solution.

A hybrid commodity price-forecasting model applied to the sugar-alcohol sector

Accurate price forecasting for agricultural commodities can have significant decision-making implications for suppliers, especially those of biofuels, where the agriculture and energy sectors intersect. Environmental pressures and high oil prices affect demand for biofuels and have reignited the discussion about effects on food prices. Suppliers in the sugar-alcohol sector need to decide the ideal proportion of ethanol and sugar to optimise their financial strategy. Prices can be affected by exogenous factors, such as exchange rates and interest rates, as well as non-observable variables like the convenience yield, which is related to supply shortages. The literature generally uses two approaches: artificial neural networks (ANNs), which are recognised as being in the forefront of exogenous-variable analysis, and stochastic models such as the Kalman filter, which is able to account for non-observable variables. This article proposes a hybrid model for forecasting the prices of agricultural commodities that is built upon both approaches and is applied to forecast the price of sugar. The Kalman filter considers the structure of the stochastic process that describes the evolution of prices. Neural networks allow variables that can impact asset prices in an indirect, nonlinear way, what cannot be incorporated easily into traditional econometric models.

Adjusting prices in the multiple-partners assignment game

Starting with an initial price vector, prices are adjusted in order to eliminate the excess demand and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which set of sellers should those transfers be made is the key issue in the description of the algorithm. We assume additively separable utilities and introduce a novel distinction by considering multiple sellers owing multiple identical objects and multiple buyers with an exogenously defined quota, consuming more than one object but at most one unit of a seller`s good and having multi-dimensional payoffs. This distinction induces a necessarily more complicated construction of the over-demanded sets than the constructions of these sets for the other assignment games. For this approach, our mechanism yields the buyer-optimal competitive equilibrium payoff, which equals the buyer-optimal stable payoff. The symmetry of the model allows to getting the seller-optimal stable payoff and the seller-optimal competitive equilibrium payoff can then be also derived.

Flex cars and the alcohol price

We build a model that incorporates the effect of the innovative ""flex"" car, an automobile that is able to run with either gasoline or alcohol, on the dynamics of fuel prices in Brazil. Our model shows that differences regarding fuel prices will now depend on the proportions of alcohol, gasoline and flex cars in the total stock. Conversely, the demand for each type of car will also depend on the expected future prices of alcohol and gasoline (in addition to the car prices). The model reflects our findings that energy prices are tied in the long run and that causality runs stronger from gasoline to alcohol. The estimated error correction parameter is stable, implying that the speed of adjustment towards equilibrium remains unchanged. The latter result is probably due to a still small fraction of flex cars in the total stock (approx. 5%), despite the fact that its sales nearly reached 100% in 2006. (C) 2009 Elsevier B.V. All rights reserved.

CONSIDERATIONS ON THE REINTRODUCTION AND RECOVERY OF THE ALAGOAS CURASSOW MITU MITU (LINNAEUS, 1766) FROM EXTINCTION USING A POTENTIALLY HYBRID CAPTIVE STOCK

The Alagoas Curassow Mitu mitu is considered extinct in the wild. Since 1979, two females and a male caught in the wild have bred successfully in captivity, and, in 1990, hybridizations between M. mitu and Razor-billed Mitu M. tuberosum were performed. By June 2008, there were around 130 living birds in two different aviaries. We sequenced two regions of the mitochondrial DNA of both captive stocks of Alagoas Curassows. We unequivocally identified hybrids that have haplotype typical of M. tuberosum. However, unless the original studbook can be recovered there is no confident way to discriminate ""pure"" M. mitu birds for breeding and reintroduction purposes. Allied with morphological data gathered in an independent study, we suggest that conservation actions need to focus on specimens with diagnostic phenotypic characters of M. mitu, and avoid birds with mitochondria, genetic contribution of M. tuberosum. Although we have detected low levels of genetic variability among captive birds, the steady increase of the captive population suggests that inbreeding depression and hybridization are not a reproductive hindrance. Reintroduction of some of these potential hybrid birds in the original area of occurrence of the Alagoas Curassow may be the only hope to fill in the ecological niche left vacant. An educational program involving local communities to conserve future reintroduction of curassows and their restored habitat is highly recommended. Accepted 12 November 2009.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

A coupling cutting stock-lot sizing problem in the paper industry

An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.