Reaching Feasibility Quickly for Sets of Linear Constraints

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.

Creator: 

Brion, Vladislav

Date: 

2018

Abstract: 

Finding a feasible solution for a set of linear constraints and bounds is an essential step in many problems, including linear programming. Many linear systems have large numbers of variables and constraints, and the computation time for finding a feasible point can be very large. This thesis proposes an improved projection method for finding a feasible point in linear systems. The method increases the acceleration and improves the direction of movement towards the feasible region. Multiple algorithms developed in this research apply various approaches for the movement acceleration. The thesis also develops an optimization model for finding an optimal set of algorithms having the highest performance in a concurrent implementation. A new presolving technique is introduced which simplifies a linear system before starting the main algorithms. Concurrent computing of the algorithms is proposed for finding a feasible point in large linear systems.

Subject: 

System Science

Language: 

English

Publisher: 

Carleton University

Thesis Degree Name: 

Master of Applied Science: 
M.App.Sc.

Thesis Degree Level: 

Master's

Thesis Degree Discipline: 

Engineering, Electrical and Computer

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).