
Reaching Feasibility Quickly for Sets of Linear Constraints
Author(s) -
Vladislav Brion
Publication year - 2018
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.22215/etd/2018-12694
Subject(s) - linear programming , acceleration , mathematical optimization , set (abstract data type) , linear system , interior point method , computer science , point (geometry) , linear fractional programming , feasible region , computation , projection (relational algebra) , algorithm , mathematics , geometry , classical mechanics , programming language , mathematical analysis , physics