Max-algebra and pairwise comparison matrices, II

This paper is a continuation of our 2004 paper “Max-algebra and pairwise comparison matrices”, in which the max-eigenvector of a symmetrically reciprocal matrix was used to approximate such a matrix by a transitive matrix. This approximation was based on minimizing the maximal relative error. In a later paper by Dahl a different error measure was used and led to a slightly different approximating transitive matrix. Here some geometric properties of this approximation problem are discussed. These lead, among other results, to a new characterization of a max-eigenvector of an irreducible nonnegative matrix. The case of Toeplitz matrices is discussed in detail, and an application to music theory that uses Toeplitz symmetrically reciprocal matrices is given.     

Lindelöf spaces which are Menger, Hurewicz, Alster, productive, or D

We discuss relationships in Lindelöf spaces among the properties “Menger”, “Hurewicz”, “Alster”, “productive”, and “D”.     

Exploring the critical pillars and causal relations within the NRI: An innovative approach

The Global Information Technology Report released by the World Economic Forum (WEF) has employed networked readiness index (NRI) to measure the global competitiveness of a country’s information and communication technologies (ICT) diffusion. The final NRI overall scores were measured by an arithmetic mean aggregation of the composite pillars scores, which implicitly assumed that all the pillars have constant weights. The Report did not explore the critical pillars and causal relations for better decision making. To add values to this Report, the objective of this paper is to propose an innovative approach by using data mining techniques and partial least squares path modeling to scrutinize the critical pillars within the NRI and to further explore the causal relations amongst them. An empirical analysis based on the latest Report (2009-2010) is carried out. The results show that “business usage,” “business readiness,” and “market environment” are the three root drivers—critical pillars to manipulate the NRI overall scores; whereas “government readiness,” which is further mostly affected by the “government usage,” is the foremost enabler to the NRI overall scores. Based on the results, policy makers are suggested to allocate limited resources with priority to the three root drivers and one foremost enabler to frog-leap the global competitiveness of national ICT diffusion.     

Lindelöf spaces which are indestructible, productive, or D

We discuss relationships in Lindelöf spaces among the properties “indestructible”, “productive”, “D”, and related properties.     

An application of the Kriging method in global sensitivity analysis with parameter uncertainty

For structural systems with both epistemic and aleatory uncertainties, the effect of epistemic uncertainty on failure probability is measured by the variance based sensitivity analysis, which generally needs a “triple-loop” crude sampling procedure to solve and is time consuming. Thus, the Kriging method is employed to avoid the complex sampling procedure and improve the computational efficiency. By utilizing the Kriging predictor model, the conditional expectation of failure probability on the given epistemic uncertainty can be calculated efficiently. Compared with the Sobol’s method, the proposed one can ensure reasonable accuracy of results but with lower computational cost. Three examples are employed to demonstrate the reasonability and efficiency of the proposed method.     

A method for efficiently computing the number of codewords of fixed weights in linear codes

The problem of computing the number of codewords of weights not exceeding a given integer in linear codes over a finite field is considered. An efficient method for solving this problem is proposed and discussed in detail. It builds and uses a sequence of different generator matrices, as many as possible, so that the identity matrix takes disjoint places in them. The efficiency of the method is achieved by optimizations in three main directions: (1) the number of the generated codewords, (2) the check whether a given codeword is generated more than once, and (3) the operations for generating and computing these codewords. Since the considered problem generalizes the well-known problems “Weight Distribution” and “Minimum Distance”, their efficient solutions are considered as applications of the algorithms from the method.     

On the potential balance among compulsory education outcomes through econometric and multiobjective programming analysis

This paper sheds new light on the relationship between inputs and outputs in the framework of the educational production function. In particular, it is geared at gaining a better understanding of which factors may be affected in order to achieve an optimal educational output level. With this objective in mind, we analyze teacher-based assessments (actual marks) in three different subjects using a multiobjective schema. For much of the analysis we use data from a recent (2010) Survey – ESOC10, linked with the results from an educational assessment program conducted among 11 and 15 year-old students and with the administrative records on teacher-based scores. Following the statistical and econometric analysis of these data, they are used to build a multiobjective mixed integer model. A reference point approach is used to determine the profile of, potentially, the most “successful and balanced” students in terms of educational outcomes. This kind of methodology in multiobjective programming allows generating “very balanced” solutions in terms of the objective values (subjects). Finally, a sensitivity analysis is used to determine policies that can be carried out in order to improve the performance levels of primary and secondary education students. Particularly, policy makers should be more concerned with the need to promote some cultural habits – such as reading –, from both the students’ and parents’ side. Additionally, policy efforts should be focused on making the vocational pathways available to Spanish youth more appealing, with the aim of taking advantage of the particular skills of students not succeeding in the academic track.     

Characterizations of the optimal stable allocation mechanism

The stable allocation problem is the generalization of (0,1)-matching problems to the allocation of real numbers (hours or quantities) between two separate sets of agents. The same unique-optimal matching (for one set of agents) is characterized by each of three properties: “efficiency”, “monotonicity”, and “strategy-proofness”.     

Extension of VIKOR method for decision making problem based on hesitant fuzzy set

The multiple criteria decision making (MCDM) methods VIKOR and TOPSIS are all based on an aggregating function representing “closeness to the ideal”, which originated in the compromise programming method. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an “individual regret” for the “opponent”, which is an effective tool in multi-criteria decision making, particularly in a situation where the decision maker is not able, or does not know to express his/her preference at the beginning of system design. The TOPSIS method determines a solution with the shortest distance to the ideal solution and the greatest distance from the negative-ideal solution, but it does not consider the relative importance of these distances. And, the hesitant fuzzy set is a very useful tool to deal with uncertainty, which can be accurately and perfectly described in terms of the opinions of decision makers. In this paper, we develop the E-VIKOR method and TOPSIS method to solve the MCDM problems with hesitant fuzzy set information. Firstly, the hesitant fuzzy set information and corresponding concepts are described, and the basic essential of the VIKOR method is introduced. Then, the problem on multiple attribute decision marking is described, and the principles and steps of the proposed E-VIKOR method and TOPSIS method are presented. Finally, a numerical example illustrates an application of the E-VIKOR method, and the result by the TOPSIS method is compared.     

Localization for branching random walks in random environment

We consider branching random walks in d$d$-dimensional integer lattice with time–space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If d≥3$d\ge 3$ and the environment is “not too random”, then, the total population grows as fast as its expectation with strictly positive probability. If, on the other hand, d≤2$d\le 2$, or the environment is “random enough”, then the total population grows strictly slower than its expectation almost surely. We show the equivalence between the slow population growth and a natural localization property in terms of “replica overlap”. We also prove a certain stronger localization property, whenever the total population grows strictly slower than its expectation almost surely.     

On contracts for VMI program with continuous review (r, Q) policy

Based on continuous review (r, Q) policy, this paper deals with contracts for vendor managed inventory (VMI) program in a system comprising a single vendor and a single retailer. Two business scenarios that are popular in VMI program are “vendor with ownership” and “retailer with ownership”. Taking the system performance in centralized control as benchmark, we define a contract “perfect” if the contract can enable the system to be coordinated and can guarantee the program to be trusted. A revenue sharing contract is designed for vendor with ownership, and a franchising contract is designed for retailer with ownership. Without consideration of order policy and related costs at the vendor site, it is shown that one contract can perform satisfactorily and the other one is a perfect contract. With consideration of order policy and related costs at the vendor site, it is shown that one contract can perform satisfactorily and the performance of the other one depends on system parameters.     

A dual simplex-based method for determination of the right and left returns to scale in DEA

This study reviews the concept of the “right” and the “left” returns to scale (RTS) in data envelopment analysis (DEA), and a dual simplex-based method, for determining these two notions in RTS, is proposed, which has computational advantages as compared to the customary method.     

Completing Diophantus, De polygonis numeris, prop. 5

The last proposition of Diophantus’ De polygonis numeris, inquiring the number of ways that a number can be polygonal and apparently aiming at “simplifying” the definitory relation established by Diophantus himself, is incomplete. Past completions of this proposition are reported in detail and discussed, and a new route to a “simplified” relation is proposed, simpler, more transparent and more “Greek looking” than the others. The issue of the application of such a simplified relation to solving the problem set out by Diophantus is also discussed in full detail.     

On the algebraic solution of fuzzy linear systems based on interval theory

In this paper, fuzzy linear systems involving a crisp square matrix and a fuzzy right-hand side vector are considered. A new approach to solve such systems based on interval theory and the new concept “interval inclusion linear system” is proposed. Also, new necessary and sufficient conditions are derived for obtaining the unique algebraic solution. Numerical examples are given to illustrate the efficiency of the proposed method.     

A caving degree approach for the single container loading problem

Inspired by an old adage “Gold corner, silver side and strawy void”, and improved by a new observation “Maximum value in diamond cave”, a new heuristic approach is proposed for solving the three-dimensional single container loading problem. Differing from several previous approaches, its key issue is to pack the outside item into a corner or even a cave in the container such that the item is as compactly and closely as possible with other packed items. Experiments are on two groups of public and difficult benchmarks. For the 47 without-orientation-constraint instances from the OR-Library, experiments indicate an average packing utilization of 94.9%, which improves current best result reported in the literature by 3.9%. For the 800 strongly heterogeneous instances among 1500 representative benchmarks proposed by Bischoff et al., (100 instances in a set), experiments show an average packing utilization of 87.97%, which improves current best record reported in the literature by 0.28%. Besides, new best records are achieved on the latter five sets among the eight sets of strongly heterogeneous benchmarks.     

Average optimality for continuous-time Markov decision processes with a policy iteration approach

This paper deals with the average expected reward criterion for continuous-time Markov decision processes in general state and action spaces. The transition rates of underlying continuous-time jump Markov processes are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. We give conditions on the system's primitive data and under which we prove the existence of the average reward optimality equation and an average optimal stationary policy. Also, under our conditions we ensure the existence of ?-average optimal stationary policies. Moreover, we study some properties of average optimal stationary policies. We not only establish another average optimality equation on an average optimal stationary policy, but also present an interesting “martingale characterization” of such a policy. The approach provided in this paper is based on the policy iteration algorithm. It should be noted that our way is rather different from both the usually “vanishing discounting factor approach” and the “optimality inequality approach” widely used in the previous literature.     

Fast solving of weighted pairing least-squares systems

This paper presents a generalization of the “weighted least-squares” (WLS), named “weighted pairing least-squares” (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods, suitable for solving full rank systems as well as rank deficient systems, are studied. Computational experiments clearly show that the best method, in terms of speed, accuracy, and numerical stability, is based on a special {1, 2, 3}-inverse, whose computation reduces to a very simple generalization of the usual “Cholesky factorization-backward substitution” method for solving linear systems.     

Bifurcation with a two-dimensional kernel

We present a theorem ensuring the existence of local solution branches for one-parameter bifurcation problems in which the linearization at the trivial solution possesses a two-dimensional kernel. In particular, we provide a straightforward “test” that is sufficient for the existence of local solution continua. We demonstrate our abstract theorem with several concrete examples for second-order systems of elliptic partial differential equations with symmetry.     

How strange can an attractor for a dynamical system in a 3-manifold look?

The aim of this paper is to characterise those compact subsets K of 3-manifolds M that are (stable and not necessarily global) attractors for some flow on M. We will show that it is the topology of M−K, rather than that of K, the one that plays a relevant role in this problem.A necessary and sufficient condition for a set K to be an attractor is that it must be an “almost tame” subset of M in a sense made precise under the equivalent notions of “weakly tame” and “tamely embedded up to shape”, defined in the paper. These are complemented by a further equivalent condition, “algebraic tameness”, which has the advantage of being checkable by explicit computation.A final section of the paper is devoted to a partial analysis of the same question when one replaces flows by discrete dynamical systems.     

A comparison of different quantity discount pricing policies in a two-echelon channel with stochastic and asymmetric demand information

In this paper, we study quantity discount pricing policies in a channel of one manufacturer and one retailer. The paper assumes that the channel faces a stochastic price-sensitive demand but the retailer can privately observe the realization of an uncertain demand parameter. The problem is analyzed as a Stackelberg game in which the manufacturer declares quantity discount pricing schemes to the retailer and then the retailer follows by selecting the retail price and associated quantity. Proposed in the paper are four quantity-discount pricing policies: “regular quantity discount”; “fixed percentage discount”; “incremental volume discount” and “fixed marginal-profit-rate discount”. Optimal solutions are derived, and numerical examples are presented to illustrate the efficiency of each discount policy.