Compositional data, i.e. data including only relative information, need to be transformed prior to applying the standard discriminant analysis methods that are designed for the Euclidean space. Here it is investigated for linear, quadratic, and Fisher discriminant analysis, which of the...

The operations of edge addition and deletion for hierarchical log-linear models are defined, and polynomial-time algorithms for the operations are given. Copyright The Author(s) 2012

This paper proposes a new step called the P-step to handle the linear or nonlinear equality constraint in addition to the conventional EM algorithm. This new step is easy to implement, first because only the first derivatives of the object function and the constraint function are necessary, and...

In this paper, we develop a method of study of Levitin–Polyak well-posedness notions for vector valued optimization problems using a class of scalar optimization problems. We first introduce a non-linear scalarization function and consider its corresponding properties. We also introduce the...

This paper presents continuous learning methods in a monopoly pricing problem where the firm has uncertainty about the buyers’ preferences. The firm designs a menu of quality-price bundles and adjusts them using only local information about the buyers’ preferences. The learning methods...

In a multivariate stratified sampling more than one characteristic are defined on every unit of the population. An optimum allocation which is optimum for one characteristic will generally be far from optimum for others. A compromise criterion is needed to work out a usable allocation which is...

The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where there have been tremendous advances in practical problem solving, STPP remains very difficult. Most heuristics schemes are ineffective and even...

We consider a model for determining optimal opportunistic maintenance schedules w.r.t. a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165–175, 1991 ) and is a natural starting point for modelling replacement schedules of more complex...

Bin packing problems are at the core of many well-known combinatorial optimization problems and several practical applications alike. In this work we introduce a novel variant of an abstract bin packing problem which is subject to a chaining constraint among items. The problem stems from an...

In this paper the interval valued function is defined in the parametric form and its properties are studied. A methodology is developed to study the existence of the solution of a general interval optimization problem, which is expressed in terms of the interval valued functions. The methodology...