Karmarkar's algorithm

Date

5-1988

Degree

Bachelor of Science in Applied Mathematics

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Norberto R. Navarrete Jr.

Abstract

A new polynomial-time algorithm for linear programming is examined. Using presentations of conventional methods like simplex and Khatchiyan, Karmarkar's Algorithm is introduced to a student who at least have a knowledge in linear programming. A demonstration software was created using Turbo Pascal Version 4. A complete implementation which includes a data handling mechanism was also made using Turbo Pascal Version 3.

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