Sökning: "simplex"
Visar resultat 1 - 5 av 42 uppsatser innehållade ordet simplex.
1. A Journey Through the World of Compression with IRS Contracts
Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysikSammanfattning : By participating in the market a party buys and sells different types of contracts resulting in the collection of contracts growing. With a large collection of contracts come the hurdles of an increasing operational cost, a harder-to-manage order book, and an increase in counterparty risk. LÄS MER
2. Random Edge is not faster than Random Facet on Linear Programs
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : A Linear Program is a problem where the goal is to maximize a linear function subject to a set of linear inequalities. Geometrically, this can be rephrased as finding the highest point on a polyhedron. The Simplex method is a commonly used algorithm to solve Linear Programs. LÄS MER
3. Back analysis of rock mass properties in the regional fault zone under Lake Mälaren
Master-uppsats, KTH/Jord- och bergmekanikSammanfattning : The properties of the surrounding rock mass in underground projects have significant impacts on the design and construction. However, it is quite challenging to evaluate rock mass properties due to the great uncertainties of the geological conditions. LÄS MER
4. Modelling Ganymede’s Aurora
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : A 3D model of Ganymede’s aurora is created using captured data from the Space Telescope Imaging Spectrograph (STIS), on board the Hubble Space Telescope (HST). The data is processed into 24 images and analyzed. A 3D grid is generated around the moon to implement a functional model to describe the aurora. LÄS MER
5. Linear Programming Algorithms for Multi-commodity Flow Problems
Kandidat-uppsats, KTH/FysikSammanfattning : A multi-commodity flow problem consists of moving several commodities from their respective sources to their sinks through a network where each edge has different costs and capacity constraints. This paper explores different linear programming algorithms and their performance regarding finding an optimal solution for multi-commodity flow problems. LÄS MER