Bi-Objective linear programming

Date

4-1995

Degree

Bachelor of Science in Applied Physics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Norberto R. Navarrete Jr.

Abstract

In a Linear programming problem, generally a single objective is considered. But in a variety of linear programming problems two or more objectives are relevant . Clearly, methods in multi objective linear programming problems can solve a bi-objective problem but the computational efforts are greatly involved. The computational difficulty on these methods arises from the fact that each of these methods finds the extreme point of the nondominated set in the decision space where such extreme points are many. Hence, the paper develops a method of solving bi-objective I ,rear program by determining the extreme points of the nondominated set in the criterion space instead of or the decision space. This approach has the advantage of working on two dimensional criterion space instead of a high dimensional decision space. The method uses Convex Combination Parametric Programming. A numerical Example is included.

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