Authors:
Akira Kawaguchi
and
Jose Alfredo Perez
Affiliation:
The City College of New York, United States
Keyword(s):
Linear programming, simplex method, revised simplex method, database, stored procedure.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Decision Support Systems
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
Solving large-scale optimization problems requires an integration of data-analysis and data-manipulation capabilities. Nevertheless, little attempt has been made to facilitate general linear programming solvers for database environments. Dozens of sophisticated tools and software libraries that implement linear programming model can be found. But, there is no database-embedded linear programming tool seamlessly and transparently utilized for database processing. The focus of this study is to fill out this kind of technical gap of data analysis and data manipulation, in the event of solving large-scale linear programming problems for the applications built on the database environment. Specifically, this paper studies the representation of the linear programming model in relational structures and the computational method to solve the linear programming problems. Foundations for and preliminary experimental results of this study are presented.