THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

https://bura.brunel.ac.uk/bitstream/2438/17829/4/FullText.pdf

Big data analytics in supply chain management: A state-of-the-art literature review

Introduction. Simple Comparison Experiments. Two Factors, Each at Two Levels. Two Factors, Each at Three Levels. Unreplicated Three--Factor, Two--Level Experiments. Unreplicated Four--Factor, Two--Level Experiments. Three Five--Factor, Two--Level Unreplicated Experiments. Larger Two--Way Layouts. The Size of Industrial Experiments. Blocking Factorial Experiments, Fractional Replication--Elementary. Fractional Replication--Intermediate. Incomplete Factorials. Sequences of Fractional Replicates. Trend--Robust Plans. Nested Designs. Conclusions and Apologies.

Applications in Statistics to Industrial Experimentation.

We address a vendor-managed inventory-routing problem where a supplier (vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to visit the retailers such that systemwide inventory holding and routing costs are minimized. We propose a branch-and-cut algorithm and a heuristic based on an a priori tour using a strong formulation. To the best of our knowledge, this study is the first to consider a strong formulation for the inventory replenishment part of inventory-routing problems. Computational results reveal that the new branch-and-cut algorithm and heuristic perform better than those noted in the literature.

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem

Twin support vector machine (TSVM) is a novel machine learning algorithm, which aims at finding two nonparallel planes for each class. In order to do so, one needs to resolve a pair of smaller-sized quadratic programming problems rather than a single large one. Classical TSVM is proposed for the binary classification problem. However, multi-class classification problem is often met in our real world. For this problem, a new multi-class classification algorithm, called Twin-KSVC, is proposed in this paper. It takes the advantages of both TSVM and K-SVCR (support vector classification-regression machine for k-class classification) and evaluates all the training points into a “1-versus-1-versus-rest” structure, so it generates ternary outputs { −1, 0, +1}. As all the samples are utilized in constructing the classification hyper-plane, our proposed algorithm yields higher classification accuracy in comparison with other two algorithms. Experimental results on eleven benchmark datasets demonstrate the feasibility and validity of our proposed algorithm.

A Twin Multi-Class Classification Support Vector Machine

In this article, we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Ptak for the linear system in complementarity problem using game theoretic approa...

More on hidden Z-matrices and linear complementarity problem

Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note we provide several clarifications of the claims made in [3]. Finally, we feel that solving any LCP by the approach given in [3] may not be as useful as it is claimed.

A note on linear complementarity problems and multiple objective programming

On singular N0-matrices and the class Q

In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of special structure. We observe that the optimality of North West corner solution holds for the general problem where cost component is replaced by a convex function. We revisit assignment problem and present a weighted version of K$\ddot{\mbox{o}}$nig-Egerv$\acute{\mbox{a}}$ry theorem and Hungarian method. The weighted Hungarian method proposed in the paper can be used for solving transportation problem.

http://yujor.fon.bg.ac.rs/index.php/yujor/article/download/763/637

Some Aspects on Solving Transportation Problem

Modeling a Jamming Game for Wireless Networks (A Garnaev) Existence of Nash Networks in the One-Way Flow Model of Network Formation (J Derks et al.) Strategic Advertisement with Externalities: A New Dynamic Approach (R Joosten) A New Axiomatization of the Shapley Value for TU-Games in Terms of Semi-Null Players Applied to 1-Concave Games (T S H Driessen) Coextrema Additive Operators (T Ui et al.) Models without Main Players (T S Arthanari) Weak Convergence of an Iterative Scheme with a Weaker Coefficient Condition (Y Kimura) Complementarity Modeling and Game Theory: A Survey (S K Neogy & A K Das) and other papers.

A. K. Das

Papers

More on hidden Z-matrices and linear complementarity problem

A note on linear complementarity problems and multiple objective programming

On singular N0-matrices and the class Q

Some Aspects on Solving Transportation Problem

Modeling, computation and optimization