On the public citation graph

ProperD-solutions of multiobjective programming problems with set functions

https://doi.org/10.1007/bf00939217
0 signed · 36 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.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
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

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.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/0-387-23639-2_19openalex-snapshot
New Generalized Invexity for Duality in Multiobjective Programming Problems Involving N-Set Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_25openalex-snapshot
Optimality and Wolfe Duality for Multiobjective Programming Problems Involving n-set Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_7openalex-snapshot
Vector Invex N-set Functions and Minmax Programming
inferred← citeshttps://doi.org/10.1007/bf00938538openalex-snapshot
Lagrangian function and duality theory in multiobjective programming with set functions
inferred← citeshttps://doi.org/10.1007/bf00940508openalex-snapshot
Lagrange multiplier theorem of multiobjective programming problems with 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)90045-hopenalex-snapshot
Sufficiency criteria and duality for nonlinear programs involving n-set functions
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90046-iopenalex-snapshot
Duality for generalized fractional programs involving 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/0898-1221(91)90118-nopenalex-snapshot
Duality theorems of vector-valued n-set functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.062openalex-snapshot
Optimality and duality for a multi-objective programming problem involving generalized d-type-I and related 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.1051/ro/1997310302111openalex-snapshot
Cone convexity of measured set vector functions and vector optimization
inferred← citeshttps://doi.org/10.1080/02331938908843457openalex-snapshot
Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
inferred← citeshttps://doi.org/10.1080/02331939108843661openalex-snapshot
Optimality conditions and duality for multiobjective measurable subset selection problems
inferred← citeshttps://doi.org/10.1080/02331939108843695openalex-snapshot
Oil minmax programming problems containing n-set 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.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.1081/nfa-120023863openalex-snapshot
Approximate Saddle Point and Duality for Multiobjective n -Set Optimization
inferred← citeshttps://doi.org/10.1142/9789812817297_0033openalex-snapshot
DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS INVOLVING n-SET 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
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.