On the public citation graph
Lagrangian function and duality theory in multiobjective programming with set functions
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00933437openalex-snapshot
Duality theory in multiobjective programming
inferredcites →https://doi.org/10.1007/bf00939217openalex-snapshot
ProperD-solutions of multiobjective programming problems with set functions
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
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(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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1006/jmaa.1999.6425openalex-snapshot
Lagrange Duality in Multiobjective Fractional Programming Problems with n-Set Functions
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/bf00940508openalex-snapshot
Lagrange multiplier theorem of multiobjective programming problems with set functions
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.1007/s10898-007-9246-xopenalex-snapshot
Variable preference modeling with ideal-symmetric convex cones
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.1051/ro/1997310302111openalex-snapshot
Cone convexity of measured set vector functions and vector optimization
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.2002.10701056openalex-snapshot
Optimality conditions and duality for programming problems involving set andn-set functions : a survey
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/2013/573408openalex-snapshot
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order
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
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.