On Gilmore gomory algorithm for solving linear fractional program

Date

3-1988

Degree

Bachelor of Science in Applied Physics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Norberto R. Navarrete Jr.

Abstract

The Gilmore Gomory Algorithm was used in solving linear fractional program. It was shown that the algorithm is a special case of the convex Simple Method of Zangwill in which case f(x) is defined to be a ratio of two linear functions n9x0 and d(x). Results also shown that f(x) is both pseudoconcave and pseudoconcave and hence is also quasiconcave, quasiconcave, strictly quasiconcavex, and strictly quasiconcave. It was also shown that a point satisfying the Kuhn Tucker Conditions is a global optimum. The algorithm was implemented as a computer code.

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