"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.
Antle, Charles E.
Chenoweth, Robert Dean
Gillett, Billy E.
James, William Joseph
Mathematics and Statistics
M.S. in Applied Mathematics
University of Missouri at Rolla
v, 77 pages
© 1965 William John Lodholz, All rights reserved.
Thesis - Open Access
Library of Congress Subject Headings
Print OCLC #
Electronic OCLC #
Link to Catalog Recordhttp://laurel.lso.missouri.edu/record=b1068689~S5
Lodholz, William John, "Linear and quadratic programming with more than one objective function" (1965). Masters Theses. 5203.