CV Lattes
ResearcherID
ORCID
Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica (IMECC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Bacharelado em Física from Universidade Estadual de Campinas (1985), graduation at Bacharelado Em Ciências da Computação from Universidade Estadual de Campinas (1986), master's at Electric Engineering from Universidade Estadual de Campinas (1989), master's at Computational And Applied Mathematics from Rice University (1994) and doctorate at Computational And Applied Mathematics from Rice University (1997). He is currently full professor at Universidade Estadual de Campinas. Has experience in Production Engineering, focusing on Linear, Nonlinear, Mixing and Dynamic Programming, acting on the following subjects: métodos de pontos interiores, programação linear, sistemas de potência, precondicionadores and programação quadrática. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
This research project aims to solve mining problems by applying interior point methods for solving sub-problems arising from Branch and cut/price type methods. It has been shown that interior point methods are superior solving the relaxed problem and sub-problems in some branch and cut/price applications in comparison with the simplex method. Among such as variations there arelogistics pr…
(Only some records are available in English at this moment)
This project means to investigate the Gilmore and Gomory method application in order to solve the unidimensional cutting problem modeled as a continuous linear programming problem, generating several cutting patterns simultaneously, getting an integer problem solved by branch-and-bound. We will perform a comparison with the original results obtained by Gilmore and Gomory and in more recen…
The interior point methods for the pre-dispatch generation and transmission loss minimization cc problem of a hydro power system with topology change and security constraints are developed. The resulting matrix structure is exploited aiming an efficient implementation. Considering that the load energy demand varies along the day, the generated power should follow such variation. In the hy…
The simple linear programming algorithms have appeared from the generalization of Von Neumann ideas. The main advantage of such algorithms is the simplicity, that is, in each iteration, it is only needed to perform matrix vector multiplications and solve positive definite linear systems of small dimension, On the other hand, the continued iteration consists in projecting the search direct…
The simple linear programming algorithms have appeared from the generalization of Von Neumann ideas. The main advantage of such algorithms is the simplicity, that is, in each iteration, it is only needed to perform matrix vector multiplications and solve positive definite linear systems of small dimension, On the other hand, the continued iteration consists in projecting the search direct…
(Only some records are available in English at this moment)
The proposal for scientific cooperation arises from the possibility of combining my knowledge of interior point methods, and the knowledge of Prof. Lamghari in solving integer or mixed programming problems in the mining sector.When interior point methods for linear programming appeared, it did not initially change the approach to solving integer programming problems using branch and bound…
| 21 / 9 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 22 / 9 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 45 / 20 | All research grants and scholarships |
| Associated processes | |