Algorithm for a general discrete k-out-of-n: G system subject to several types of failure with an indefinite number of repairpersons

A discrete k-out-of-n: G system with multi-state components is modelled by means of block-structured Markov chains. An indefinite number of repairpersons are assumed and PH distributions for the lifetime of the units and for the repair time are considered. The units can undergo two types of failures, repairable or non-repairable. The repairability of the failure can depend on the time elapsed up to failure. The system is modelled and the stationary distribution is built by using matrix analytic methods. Several performance measures of interest, such as the conditional probability of failure for the units and for the system, are built into the transient and stationary regimes. Rewards are included in the model. All results are shown in a matrix algorithmic form and are implemented computationally with Matlab. A numerical example of an optimization problem shows the versatility of the model.     

Optimality conditions and duality for a minimax fractional programming with generalized convexity

We establish the sufficient conditions for generalized fractional programming from a viewpoint of the generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of duals of the generalized fractional programming. We extend the corresponding results of several authors.     

Polynomial sequential continuity on C(K,E) spaces

We show that, for bounded sequences in C(K,E), the polynomial sequential convergence is not equivalent to the pointwise polynomial sequential convergence. We introduce several conditions on E under which different versions of the result are true when K is a scattered compact space. These conditions are related with some others appeared in the literature and they seem to be of independent interest.     

Generating ε-efficient solutions in multiobjective programming

Scalarization approaches to purposely generating ε-efficient solutions of multiobjective programs are investigated and a generic procedure for computing these solutions is proposed and illustrated with an example. Real-life decision making situations in which the solutions are of significance are described.     

The equivalence of curves in SL(n, R) and its application to ruled surfaces

The generating system of the differential algebra for invariant differential polynomials with two parametric curves is obtained. Conditions for the equivalence of two parametric curves families are given. We are also proved that the generating differential invariants of two parametric curves are independent. Finally, we reduce the SL(n, R)-equivalent problem for ruled surfaces to that of parametric curves.     

Error bounds for linear complementarity problems of DB-matrices

Doubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (2003) [2]. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a DB-matrix and a new bound for linear complementarity problem of a B-matrix. The numerical examples show that the bounds are sharp.     

Sobolev type spaces in quantum calculus

In this paper q-Sobolev type spaces are defined on Rq by using the q-cosine Fourier transform and its inverse. In particular, embedding results for these spaces are established. Next we define the q-cosine potential and study some of its properties.     

Complete convergence theorems for L-mixingales

Sufficient conditions for the complete convergence for the partial sums and the random selected partial sums of L^p-mixingales are given. Necessary conditions are also discussed.     

On equilibrium problem of abstract economy, generalized quasi-variational inequality, and an optimization problem in locally H-convex spaces

In this paper, the equilibrium existence problem for abstract economies, the existence problem for solution of generalized quasi-variational inequality, and an optimization problem in locally H-convex spaces are researched.     

Some results for the q-Bernoulli and q-Euler polynomials

We show some results for the q-Bernoulli and q-Euler polynomials. The formulas in series of the Carlitz's q-Stirling numbers of the second kind are also considered. The q-analogues of well-known formulas are derived from these results.     

A class of B-(p,r)-invex functions and mathematical programming

Invexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-invex functions with respect to η and b, being introduced, includes many well-known classes of generalized invex functions as its subclasses. Some properties of the introduced class of B-(p,r)-invex functions with respect to η and b are studied. Further, mathematical programming problems involving B-(p,r)-invex functions with respect to η and b are considered. The equivalence between saddle points and optima, and different type duality theorems are established for this type of optimization problems.     

On low degree k-ordered graphs

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v₁,…,v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability, and motivated by the fact that k-orderedness of a graph implies (k-1)-connectivity, they posed the question of the existence of low degree k-ordered hamiltonian graphs. We construct an infinite family of graphs, which we call bracelet graphs, that are (k-1)-regular and are k-ordered hamiltonian for odd k. This result provides the best possible answer to the question of the existence of low degree k-ordered hamiltonian graphs for odd k. We further show that for even k, there exist no k-ordered bracelet graphs with minimum degree k-1 and maximum degree less than k+2, and we exhibit an infinite family of bracelet graphs with minimum degree k-1 and maximum degree k+2 that are k-ordered for even k. A concept related to k-orderedness, namely that of k-edge-orderedness, is likewise strongly related to connectivity properties. We study this relation and give bounds on the connectivity necessary to imply k-(edge-)orderedness properties.     

Measures of inconsistency and defaults

We introduce a method for measuring inconsistency based on the number of formulas needed for deriving a contradiction. The relationships to previously considered methods based on probability measures are discussed. Those methods are extended to conditional probability and default reasoning.     

q-positive definiteness and related operators

We are in progress of extending the family of ‘q-deformed operators’ considered in the previous papers by joining to them q-subnormal as well as q-formally subnormal ones. It turns out that q-positive definiteness, a notion generalizing Halmos' standard positive definiteness of bounded subnormal operators, is likewise central for our new scheme.     

Duality in ε-variational inequality problems

In this paper a general analysis of duality for an extended ε-variational inequality problem based on the notions of ε-convexity and ε-conjugacy is performed. Optimal solutions of both the primal and dual problems are also related to the saddle point of an associated Lagrangian. Gap functions for these problems are proposed. An existence theorem for the extended ε-variational inequality is also established by means of the KKM lemma.     

e-filters of MS-algebras

The notion of e-filters is introduced in an MS-algebra and characterized. The concept of D-filters is introduced and a set of equivalent conditions under which every D-filter is an e-filter are given. The properties of the space of all prime e-filters of an MS-algebra are observed. The concept of D-prime filters is introduced and then a set of equivalent conditions are derived for a prime e-filter to become a D-prime filter in topological terms.     

An η-approximation approach to duality in mathematical programming problems involving r-invex functions

An η-approximation approach introduced by Antczak [T. Antczak, A new method of solving nonlinear mathematical programming problems involving r-invex functions, J. Math. Anal. Appl. 311 (2005) 313-323] is used to obtain a solution Mond-Weir dual problems involving r-invex functions. η-Approximated Mond-Weir dual problems are introduced for the η-approximated optimization problem constructed in this method associated with the original nonlinear mathematical programming problem. By the help of η-approximated dual problems various duality results are established for the original mathematical programming problem and its original Mond-Weir duals.     

A note on generalized q-difference equations for q-beta and Andrews–Askey integral

Two q-difference equations with solutions expressed by q-exponential operator identities are investigated. As applications, two extensions of Ramanujan?s formulas for q-beta integral are given, two generalizations of Andrews–Askey integral are obtained. In addition, generating functions for generalized Al-Salam–Carlitz polynomials are deduced. At last, a generalized transformation identity is gained.     

Two new q-exponential operator identities and their applications

In this paper, we use the q-Chu–Vandermonde formula to prove two new operator identities, which are the extensions of Liu's results. These two q-exponential operator identities are used to derive some q-summation formulas and q-integrals.     

On the modulus algorithm for the linear complementarity problem

Concerning three subclasses of P-matrices the modulus algorithm and the projected successive overrelaxation (PSOR) method solving the linear complementarity problem are compared to each other with respect to convergence. It is shown that the modulus algorithm is convergent for all three subclasses whereas the convergence of the PSOR method is only guaranteed for two of them.