Extreme convex set functions with finite carrier: General theory
From MaRDI portal
Publication:1212395
DOI10.1016/0012-365X(74)90127-7zbMath0293.90034OpenAlexW2022586520MaRDI QIDQ1212395
Hans-Günther Weidner, Joachim Rosenmüller
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(74)90127-7
Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to linear algebra (15-00)
Related Items
Core-based criterion for extreme supermodular functions ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ Extreme convex set functions with many nonnegative differences ⋮ The rôle of nondegeneracy and homogeneity in n-person game theory: An equivalence theorem ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions ⋮ DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theory ⋮ Convex games without side payments ⋮ L.P.-games with sufficiently many players ⋮ The cone of supermodular games on finite distributive lattices ⋮ The least core, nucleolus, and kernel of homogeneous weighted majority games ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Extensions of functions of 0-1 variables and applications to combinatorial optimization ⋮ The vector lattice structure of the \(n\)-person TU games ⋮ Weighted majority games and the matrix of homogeneity ⋮ A periodicity lemma in linear Diophantine analysis ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Optimality conditions and duality for multiobjective measurable subset selection problems ⋮ Sufficiency criteria and duality for nonlinear programs involving n-set functions ⋮ A necessary and sufficient condition for the convexity in oligopoly games
Cites Work
