Experimental Software Package for Linear Programming
Saved in:
| Title: | Experimental Software Package for Linear Programming |
|---|---|
| Authors: | Fogal, Deborah S. |
| Committee Members: | Brooks, George H.; University of Central Florida. College of Engineering [VIAF] University of Central Florida. College of Engineering [LC] |
| Summary: | A software package for linear programming has been developed using the revised simplex and dual simplex algorithms. The design of the program incorporates an experimental change in the dual simplex algorithm. If the entered problem is not primal feasible, a modified dual simplex algorithm is used. The traditional dual simplex method requires an initial dual feasible basis and maintains feasibility throughout its application. The experimental change is to ignore this criteria of dual feasibility. The objective then becomes to obtain primal feasibility. Once this is attained, the revised simplex algorithm is applied to obtain optimality, if this has not been reached through use of the dual. This experimental change redirects the goal of the dual simplex method from obtaining objective function optimality to obtaining primal feasibility. Program testing has shown the experimental design to produce correct results for a variety of linear programming problems. The program is written for an IBM PC using PASCAL for coding. Spreadsheet format and menus provide ease in problem input and output. Devices for output of problem and solution are printer, screen and/or disk. A problem can be saved and retrieved at a later time for editing. |
| URL: | https://stars.library.ucf.edu/rtd/4761 |
| Database: | OpenDissertations |
| Abstract: | A software package for linear programming has been developed using the revised simplex and dual simplex algorithms. The design of the program incorporates an experimental change in the dual simplex algorithm. If the entered problem is not primal feasible, a modified dual simplex algorithm is used. The traditional dual simplex method requires an initial dual feasible basis and maintains feasibility throughout its application. The experimental change is to ignore this criteria of dual feasibility. The objective then becomes to obtain primal feasibility. Once this is attained, the revised simplex algorithm is applied to obtain optimality, if this has not been reached through use of the dual. This experimental change redirects the goal of the dual simplex method from obtaining objective function optimality to obtaining primal feasibility. Program testing has shown the experimental design to produce correct results for a variety of linear programming problems. The program is written for an IBM PC using PASCAL for coding. Spreadsheet format and menus provide ease in problem input and output. Devices for output of problem and solution are printer, screen and/or disk. A problem can be saved and retrieved at a later time for editing. |
|---|
