Relação entre modelos de programação não-linear com incerteza no conjunto de restrições

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

The symmetry group of Z(q)(n) in the Lee space and the Z(qn)-linear codes

The Z(4)-linearity is a construction technique of good binary codes. Motivated by this property, we address the problem of extending the Z(4)-linearity to Z(q)n-linearity. In this direction, we consider the n-dimensional Lee space of order q, that is, (Z(q)(n), d(L)), as one of the most interesting spaces for coding applications. We establish the symmetry group of Z(q)(n) for any n and q by determining its isometries. We also show that there is no cyclic subgroup of order q(n) in Gamma(Z(q)(n)) acting transitively in Z(q)(n). Therefore, there exists no Z(q)n-linear code with respect to the cyclic subgroup.

Xylanases from fungi: properties and industrial applications

Xylan is the principal type of hemicellulose. It is a linear polymer of beta-D-xylopyranosyl units linked by (1-4) glycosidic bonds. In nature, the polysaccharide backbone may be added to 4-O-methyl-alpha-D-glucuronopyranosyl units, acetyl groups, alpha-L-arabinofuranosyl, etc., in variable proportions. An enzymatic complex is responsible for the hydrolysis of xylan, but the main enzymes involved are endo-1,4-beta-xylanase and beta-xylosidase. These enzymes are produced by fungi, bacteria, yeast, marine algae, protozoans, snails, crustaceans, insect, seeds, etc., but the principal commercial source is filamentous fungi. Recently, there has been much industrial interest in xylan and its hydrolytic enzymatic complex, as a supplement in animal feed, for the manufacture of bread, food and drinks, textiles, bleaching of cellulose pulp, ethanol and xylitol production. This review describes some properties of xylan and its metabolism, as well as the biochemical properties of xylanases and their commercial applications.

On the solution of the extended linear complementarity problem

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.