Extremal permutations with respect to weak majorizations

DOI10.1006/EUJC.1996.0055MaRDI QIDQ1815401zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang

Publication date 28 May 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1996.0055

zbMATH Keywords

extremal permutationsreliabilityweak majorizations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

Suppose a system consists of \(n\) components of different working probabilities \(p_1\), \(p_2, \dots, p_n\). The reliability of the system is a function of these probabilities, \(f(p_1,p_2, \dots, p_n)\). When these \(n\) components are exchangeable, what permutation of the components gives an optimal system? The author studies some tools to answer this kind of questions. Some sufficient conditions for several specific permutations to be optimal are presented.

Recommendations

• scientific article; zbMATH DE number 800376
• Optimal allocation of components in parallel–series and series–parallel systems
• Component allocation for a distributed system: reliability maximization
• Optimal assembly of systems using schur functions and majorization
• Optimal substitution of arguments of an arrangement increasing function based on sufficient statistics for parameter-arguments

Cited in

(5)

• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• A note on random permutations and extreme value distributions
• Chaotic numbers of complete bipartite graphs and tripartite graphs
• scientific article; zbMATH DE number 800376 (Why is no real title available?)
• Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.

This page was built for publication: Extremal permutations with respect to weak majorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815401)