A goal programming decision aid

Date

3-1991

Degree

Bachelor of Science in Applied Mathematics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Norberto R. Navarrete Jr.

Abstract

For goal programming to be useful in decision problems, making, especially in large-scale, real-life p an efficient decision aid is a necessity. In this study, the features of goal programming that the decision aid needs to support in decision making functions were identified, namely: a good modelling capability, an efficient algorithm, sensitivity analysis involving _ priorities and an efficient information management system. A combination of Lee's modified simplex and I Ignizio's revised simplex algorithms, was developed to produce a space-saving and time efficient goal programming solution method. Sensitivity analysis involving priority factors was included by allowing priority exchanges removal and addition to/from the objective function. The resulting information extracted from the optimal tableau like the goal attainment levels, basic optimal solution and slack variable levels were presented in formats where the decision maker can easily understand the results. The algorithm was implemented as a software for the IBM-PC and its compatibles using Turbo Pascal 5.0 programming language. The use of the revised simplex technique of relying upon relationships concerning simplex tableau elements and a good data structure for the representation of data requirements enabled the decision aid software to ideally, solve a goal programming model of up to 140 decision variables, 110 goal constraints and 25 Priority factors.

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

Thesis

Document Type

Thesis

This document is currently not available here.

Share

COinS