Ordinal ranking with intensity of preference using linear programming

Date

3-1989

Degree

Bachelor of Science in Agriculture

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Myrna C. Belarmino

Abstract

The study used the Linear Programming Approach as a method for solving ordinal ranking problems with degree or intensity of preference. Five outstanding SAM-UP members were ranked according to preference using a 1-10 scale. The ranking obtained from the Linear Programming Approach were compared with the results using the Kemeny and Snell and the Cook and Kress Methods.

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