Masters Theses

Abstract

"A computational procedure is presented for determining optimal solutions to the linear and quadratic programming problem when there is more than one objective function subject to linear constraints. In general a unique solution does not exist and a set of "best" or "efficient" points is determined and presented in graphical or tabular form. To solve the mathematical programming problems the simplex method is used for linear objective functions and Wolfe's method is used for quadratic objective functions"--Abstract, page ii.

Advisor(s)

Antle, Charles E.

Committee Member(s)

Chenoweth, Robert Dean
Gillett, Billy E.
James, William Joseph

Department(s)

Mathematics and Statistics

Degree Name

M.S. in Applied Mathematics

Publisher

University of Missouri at Rolla

Publication Date

1965

Pagination

v, 77 pages

Note about bibliography

Includes bibliographical references (page 74).

Rights

© 1965 William John Lodholz, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Subject Headings

Linear programming
Quadratic programming
Simplexes (Mathematics)

Thesis Number

T 1790

Print OCLC #

5968997

Electronic OCLC #

800084268

Download

Share

 
COinS