1 |
Complementarity in mathematical programmingHallman, Wayne Philip. January 1979 (has links)
Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 135-139).
|
2 |
A polyhedral approach to combinatorial complementarity programming problemsde Farias, Ismael, Jr. 12 1900 (has links)
No description available.
|
3 |
Non-interior path-following methods for complementarity problems /Xu, Song, January 1998 (has links)
Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (leaves [104]-115).
|
4 |
A preconditioned conjugate gradient frontal solver /Mishra, Munna. January 1981 (has links)
No description available.
|
5 |
The development of algorithms in mathematical programmingJahanshahlou, Gholamreza January 1976 (has links)
In this thesis some problems in mathematical programming have been studied. Chapter 1 contains a brief review of the problems studied and the motivation for choosing these problems for further investigation. The development of two algorithms for finding all the vertices of a convex polyhedron and their applications are reported in Chapter 2. The linear complementary problem is studied in Chapter 3 and an algorithm to solve this problem is outlined. Chapter 4 contains a description of the plant location problem (uncapacited). This problem has been studied in some depth and an algorithm to solve this problem is presented. By using the Chinese representation of integers a new algorithm has been developed for transforming a nonsingular integer matrix into its Smith Normal Form; this work is discussed in Chapter 5. A hybrid algorithm involving the gradient method and the simplex method has also been developed to solve the linear programming problem. Chapter 6 contains a description of this method. The computer programs written in FORTRAN IV for these algorithms are set out in Appendices Rl to R5. A report on study of the group theory and its application in mathematical programming is presented as supplementary material. The algorithms in Chapter 2 are new. Part one of Chapter 3 is a collection of published material on the solution of the linear complementary problem; however the algorithm in Part two of this Chapter is original. The formulation of the plant location problem (uncapacited) together with some simplifications are claimed to be original. The use of Chinese representation of integers to transform an integer matrix into its Smith Normal Form is a new technique. The algorithm in Chapter 6 illustrates a new approach to solve the linear programming problem by a mixture of gradient and simplex method.
|
6 |
Iterative methods for solving linear complementarity and linear programming problemsCheng, Yun-Chian. January 1981 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1981. / Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 117-121).
|
7 |
A preconditioned conjugate gradient frontal solver /Mishra, Munna. January 1981 (has links)
No description available.
|
8 |
A matrix-free linear programming duality theoryVillela, Paulo Arruda. January 1979 (has links)
Thesis: M.S., Massachusetts Institute of Technology, Department of Mathematics, 1979 / Bibliography: leaf 61. / by Paulo Arruda Villela. / M.S. / M.S. Massachusetts Institute of Technology, Department of Mathematics
|
9 |
Complementarity ProblemsLin, Yung-shen 30 July 2007 (has links)
In this thesis, we report recent results on existence for complementarity problems in infinite-dimensional spaces under generalized monotonicity are reported.
|
10 |
Equilíbrio da expansão de capacidade sob incerteza : um estudo de caso na indústria petroquímica brasileiraBassi, Gustavo Ferraresi January 2017 (has links)
A Teoria dos Jogos é amplamente utilizada no estudo de fenômenos de interação estratégica, em especial na análise de mercados de commodities. Esse trabalho faz uma análise preliminar do mercado brasileiro de eteno e propeno sob a ótica de um modelo baseado na Teoria dos Jogos, representado matematicamente através de um problema de complementaridade mista. Neste modelo, as empresas atuam em uma competição de Cournot e os custos de produção são parâmetros incertos, representados através de cenários, sendo que, no equilíbrio, três decisões devem ser tomadas: i) o portifólio de tecnologias para produção, ii) a capacidade de produção de cada tecnologia e iii) o nível de produção de cada tecnologia em cada cenário. Considerando as diversas limitações do estudo, as simulações realizadas com o modelo proposto mostram que o comportamento dos agentes da indústria petroquímica brasileira está mais próximo de tomadores de preços, sem possibilidade de regulação de preços através das quantidades produzidas. / Game Theory is widely used in the study of strategic interaction, especially in the analysis of commodity markets. This work makes a preliminary analysis of the Brazilian ethylene and propylene market from the perspective of a model based on game theory, represented mathematically by a mixed complementarity problem. In this model, firms behave as Cournot players and production costs are uncertain parameters, represented by scenarios, and in equilibrium three decisions must be made: i) the portfolio of technologies for production, ii) technologies capacity and iii) the level of production for each technology in each scenario. Considering the limitations of the study, the simulations carried out with the proposed model show that the behavior of the Brazilian petrochemical industry agents is closer to price takers, without possibility of price regulation by the quantities produced.
|
Page generated in 0.0256 seconds