On the public citation graph

Optimality for set functions with values in ordered vector spaces

https://doi.org/10.1007/bf00939803
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00938628openalex-snapshot
Duality theorem of nondifferentiable convex multiobjective programming
inferredcites →https://doi.org/10.1007/bf01604503openalex-snapshot
Journal of Mathematical Analysis and Applications
inferredcites →https://doi.org/10.1016/0022-247x(75)90022-0openalex-snapshot
A duality theorem for a convex programming problem in order complete vector lattices
inferredcites →https://doi.org/10.1016/0022-247x(77)90283-9openalex-snapshot
The saddle point theorem of Kuhn and Tucker in ordered vector spaces
inferredcites →https://doi.org/10.1016/0022-247x(79)90064-7openalex-snapshot
Optimal constrained selection of a measurable subset
inferredcites →https://doi.org/10.1016/0022-247x(79)90228-2openalex-snapshot
More on subgradient duality
inferredcites →https://doi.org/10.1016/0022-247x(81)90188-8openalex-snapshot
Duality theory for maximizations with respect to cones
inferredcites →https://doi.org/10.1016/0022-247x(83)90145-2openalex-snapshot
Duality in mathematical programming of set functions: On Fenchel duality theorem
inferredcites →https://doi.org/10.1016/0022-247x(85)90055-1openalex-snapshot
On multiple objective programming problems with set functions
inferredcites →https://doi.org/10.1016/0022-247x(86)90306-9openalex-snapshot
Epigraphs of convex set functions
inferredcites →https://doi.org/10.1016/0022-247x(88)90084-4openalex-snapshot
Moreau-Rockafellar type theorem for convex set functions
inferredcites →https://doi.org/10.1017/s0004972700006419openalex-snapshot
A duality theorem for nondifferentiable convex programming with operatorial constraints
inferredcites →https://doi.org/10.1017/s0334270000003635openalex-snapshot
Saddle point and duality in the optimization theory of convex set functions
inferredcites →https://doi.org/10.1017/s0334270000004513openalex-snapshot
Second order optimality conditions for mathematical prograramming with set functions
inferredcites →https://doi.org/10.1017/s1446788700024927openalex-snapshot
Duality theorems and an optimality condition for non-differentiable convex programming
inferredcites →https://doi.org/10.1080/02522667.1984.10698799openalex-snapshot
The Multiobjective Optimization Problem of Set Function
inferredcites →https://doi.org/10.1090/qam/135625openalex-snapshot
A duality theorem for non-linear programming
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0938649-4openalex-snapshot
The Fenchel-Moreau Theorem for Set Functions
inferredcites →https://doi.org/10.1287/mnsc.12.5.385openalex-snapshot
A Duality Theorem for Nonlinear Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jmaa.1998.6187openalex-snapshot
Duality for a Minimax Programming Problem Containingn-Set Functions
inferred← citeshttps://doi.org/10.1007/bf01874130openalex-snapshot
Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
inferred← citeshttps://doi.org/10.1007/s10012-001-0529-8openalex-snapshot
Semiparametric Sufficient Efficiency Conditions and Duality Models for Multiobjective Fractional Subset Programming Problems with Generalized (?, ?, ?)-Convex Functions
inferred← citeshttps://doi.org/10.1007/s10092-011-0050-0openalex-snapshot
Optimality conditions for multiple objective fractional subset programming with (ρ,σ,θ)-type-I and related non-convex functions
inferred← citeshttps://doi.org/10.1007/s10898-006-9023-2openalex-snapshot
Duality for Multiple Objective Fractional Subset Programming with Generalized (, ρ, σ, θ)-V-Type-I Functions
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90299-uopenalex-snapshot
Optimality of differentiable, vector-valued n-set functions
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90337-yopenalex-snapshot
On the optimality conditions of vector-valued n-set functions
inferred← citeshttps://doi.org/10.1016/0022-247x(92)90163-8openalex-snapshot
On the optimality of differentiable nonconvex n-set functions
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90118-nopenalex-snapshot
Duality theorems of vector-valued n-set functions
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.12.018openalex-snapshot
Optimality conditions for multiple objective fractional subset programming with (, ρ,σ,θ )-V-type-I and related non-convex functions
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00114-1openalex-snapshot
Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (ϝ, α, ϱ, θ)-V-convex functions
inferred← citeshttps://doi.org/10.1080/02331939708844289openalex-snapshot
A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
inferred← citeshttps://doi.org/10.1080/09720510.2003.10701087openalex-snapshot
Parametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (F, ρ, θ) -convex functions
inferred← citeshttps://doi.org/10.1155/ijmms.2005.949openalex-snapshot
Generalized (ℱ, b, φ, ρ, θ)‐univex n‐set functions and global semiparametric sufficient efficiencyconditions in multiobjective fractional subset programming
inferred← citeshttps://doi.org/10.11650/tjm.1.1997.1419openalex-snapshot
OPTIMALITY CONDITIONS FOR SEMI-PREINVEX PROGRAMMING
inferred← citeshttps://doi.org/10.11650/twjm/1500405134openalex-snapshot
OPTIMIZATION THEORY FOR SET FUNCTIONS IN NONDIFFERENTIABLE FRACTIONAL PROGRAMMING WITH MIXED TYPE DUALITY
inferred← citeshttps://doi.org/10.11650/twjm/1500406118openalex-snapshot
OPTIMALITY CONDITIONS FOR SEMI-PREINVEX PROGRAMMING
inferred← citeshttps://doi.org/10.5269/bspm.v37i3.31883openalex-snapshot
Second order duality for mathematical programming involving n-set functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.