Sökning: "linear programming"

Visar resultat 1 - 5 av 234 avhandlingar innehållade orden linear programming.

  1. 1. On Some Properties of Interior Methods for Optimization

    Författare :Göran Sporre; KTH; []
    Nyckelord :Interior method; primal-dual interior method; linear programming; quadratic programming; nonlinear programming; semidefinite programming; weighted least-squares problems; central path;

    Sammanfattning : This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments. LÄS MER

  2. 2. Dynamics and Performance of a Linear Genetic Programming System

    Författare :Frank D. Francone; Chalmers University of Technology; []
    Nyckelord :Mutation; Genetic Programming; Homologous Crossover.; Crossover; Introns; Linear Genetic Programming; Code Bloat;

    Sammanfattning : Genetic Programming (“GP”) is a machine learning algorithm. Typically, Genetic Programming is a supervised learning algorithm, which trains on labeled training examplesprovided by the user. The solution output by GP maps known attributes to the known labels. LÄS MER

  3. 3. Piecewise Linear Control Systems

    Författare :Mikael Johansson; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Piecewise quadratic functions; Linear matrix inequalities; Convex optimization; Optimal control; Performance analysis; Piecewise linear Lyapunov functions; Piecewise quadratic Lyapunov functions; Quadratic stability; Lyapunov stability; Piecewise linear systems; Nonlinear systems; Fuzzy systems; Hybrid systems.; Automation; robotics; control engineering; Automatiska system; robotteknik; reglerteknik;

    Sammanfattning : This thesis treats analysis and design of piecewise linear control systems. Piecewise linear systems capture many of the most common nonlinearities in engineering systems, and they can also be used for approximation of other nonlinear systems. LÄS MER

  4. 4. Discrete Methods used in Graph Theory and Linear Programming

    Författare :Olof Barr; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Perceptron Algorithm; Graph Theory; Linear Programming; Matematik;

    Sammanfattning : The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. LÄS MER

  5. 5. Efficient Use of Exponential Size Linear Programs

    Författare :Lukas Polacek; Johan Håstad; Nikhil Bansal; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; approximation algorithms; linear programming; allocation problems; Computer Science; Datalogi;

    Sammanfattning : In the past decades, linear programming (LP) has been successfully used to develop approximation algorithms for various optimization problems. In particular, the so-called assignment LP has lead to substantial progress for various allocation problems, including scheduling unrelated parallel machines. LÄS MER