Mathematics Commons^™

Robust I-Sample Analysis Of Means Type Randomization Tests For Variances, Anthony Joseph Bernard

UNF Graduate Theses and Dissertations

The advent of powerful computers has brought about the randomization technique for testing statistical hypotheses. Randomization tests are based on shuffles or rearrangements of the (combined) sample. Putting each of the I samples "in a bowl" forms the combined sample. Drawing samples "from the bowl" forms a shuffle. Shuffles can be made with or without replacement.

In this thesis, analysis of means type randomization tests will be presented to solve the homogeneity of variance problem. An advantage of these tests is that they allow the user to graphically present the results via a decision chart similar to a Shewhart control …

An Efficient Implementation Of The Transportation Problem, Alissa Michele Sustarsic

UNF Graduate Theses and Dissertations

The transportation problem is a special type of linear program in which the objective is to minimize the total cost of shipping a single commodity from a number of sources (m) to a number of destinations or sinks (n).

Because of the special structure of the transportation problem, a special algorithm can be designed to find an optimal solution efficiently. Due to the large amount of information in the problem, judicious storage and management of the data are essential requirements of any viable implementation of the transportation algorithm.

Using sparse matrix techniques to store the solution …