𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient Partitions for a class of coin tossing problems

✍ Scribed by Narayana, T. V. ;Chorneyko, I. ;Sathe, Y. S.

Publisher
Wiley (John Wiley & Sons)
Year
1960
Weight
323 KB
Volume
2
Category
Article
ISSN
0006-3452

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimizer graphs for a class of extremal
Minimizer graphs for a class of extremal problems
✍ Dan Ismailescu; Dan Stefanica πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph

Duality for a Class of Multiobjective Co
Duality for a Class of Multiobjective Control Problems
✍ Chen Xiuhong πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 135 KB

In this paper, a class of multiobjective control problems is considered, where the objective and constraint functions involved are f t x t αΊ‹ t y t z t with x t ∈ R n , y t ∈ R n , and z t ∈ R m , where x t and z t are the control variables and y t is the state variable. Under the assumption of invex

Duality for a Class of Nondifferentiable
Duality for a Class of Nondifferentiable Multiobjective Programming Problems
✍ Xin Min Yang; Kok Lay Teo; Xiao Qi Yang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 64 KB

In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established