On the public citation graph

Lagrange multiplier theorem of multiobjective programming problems with set functions

https://doi.org/10.1007/bf00940508
0 signed · 31 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/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/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferredcites →https://doi.org/10.1007/bf00938538openalex-snapshot
Lagrangian function and duality theory in multiobjective programming with set functions
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(79)90064-7openalex-snapshot
Optimal constrained selection of a measurable subset
inferredcites →https://doi.org/10.1016/0022-247x(83)90230-5openalex-snapshot
Efficiency and proper efficiency in vector maximization with respect to cones
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/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1090/s0002-9947-1952-0045194-xopenalex-snapshot
Finitely Additive Measures
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1216/rmj-1987-17-3-535openalex-snapshot
Convex programming with set functions
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

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.1997.5644openalex-snapshot
Optimality Conditions for Multiobjective Programming with Generalized (I,ρ,θ)-Convex Set Functions
inferred← citeshttps://doi.org/10.1006/jmaa.1998.6187openalex-snapshot
Duality for a Minimax Programming Problem Containingn-Set Functions
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.1006/jmaa.2000.6715openalex-snapshot
On Minimax Fractional Programming of Generalized Convex Set Functions
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/bf02896470openalex-snapshot
The Saddle theorem for multiobjective generalized fractional programming problems with set functions
inferred← citeshttps://doi.org/10.1007/bf02936081openalex-snapshot
Fenchel duality theorem in 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.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/02331939708844284openalex-snapshot
Optimality and duality for multiobjective programming involving subdifferentiable set functions
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.1081/nfa-120023863openalex-snapshot
Approximate Saddle Point and Duality for Multiobjective n -Set Optimization
inferred← citeshttps://doi.org/10.1142/s0217595904000199openalex-snapshot
APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
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.