Physical Sciences and Mathematics Commons^™

Integer Programming By Cutting Planes Methods, Sung-Yen Wu

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Linear programming is a relatively new, very important branch of modern mathematics and is about twenty five years old.

In this day and age, most planners and decision makers will acknowledge that some linear optimization problems are worth the expense and trouble to solve. Using linear programming technique as a tool to make decision plannes are able to greatly redice cost or increase profit for any project under consideration.

Since Dr. George B. Dantzig published his first paper on the simplex method in 1947, progress in that field has been rapid. Although the first applications were military in nature, it …

Design Optimization Using Model Estimation Programming, Richard Kay Brimhall

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Model estimation programming provides a method for obtaining extreme solutions subject to constraints. Functions which are continuous with continuous first and second derivatives in the neighborhood of the solution are approximated using quadratic polynomials (termed estimating functions) derived from computed or experimental data points. Using the estimating functions, an approximation problem is solved by a numerical adaptation of the method of Lagrange. The method is not limited by the concavity of the objective function.

Beginning with an initial array of data observations, an initial approximate solution is obtained. Using this approximate solution as a new datum point, the coefficients for …