On the public citation graph

Symmetric duality for multiobjective programming using second order (F, ρ)-convexity

https://doi.org/10.1007/bf03398778
0 signed · 25 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/978-1-4757-6075-0_2openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1007/bf01580087openalex-snapshot
Second-order global optimality conditions for convex composite optimization
inferredcites →https://doi.org/10.1016/0016-0032(51)90436-xopenalex-snapshot
Methods of operations research
inferredcites →https://doi.org/10.1016/0022-247x(75)90111-0openalex-snapshot
Second- and higher-order duality in nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(92)90303-uopenalex-snapshot
On efficiency and duality for multiobjective programs
inferredcites →https://doi.org/10.1016/j.ejor.2004.01.028openalex-snapshot
Multiobjective second-order symmetric duality with F-convexity
inferredcites →https://doi.org/10.1016/s0377-2217(02)00154-6openalex-snapshot
Second order symmetric duality in multiobjective programming
inferredcites →https://doi.org/10.1016/s0377-2217(99)00334-3openalex-snapshot
Second order symmetric duality in mathematical programming with F-convexity
inferredcites →https://doi.org/10.1017/s0004972700023431openalex-snapshot
Lagrangean conditions and quasiduality
inferredcites →https://doi.org/10.1080/02522667.1982.10698716openalex-snapshot
Further Generalizations of Convexity in Mathematical Programming
inferredcites →https://doi.org/10.1287/moor.8.2.231openalex-snapshot
Strong and Weak Convexity of Sets and Functions
inferredcites →https://doi.org/10.2140/pjm.1965.15.809openalex-snapshot
Symmetric dual nonlinear programs

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.1007/s40819-025-01946-2openalex-snapshot
Third Order Symmetric Duality in Multiobjective Programming Problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.08.031openalex-snapshot
Higher-order (F,α,ρ,d) -convexity and symmetric duality in multiobjective programming
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.05.056openalex-snapshot
Higher order duality in multiobjective fractional programming with support functions
inferred← citeshttps://doi.org/10.1080/01630563.2013.763348openalex-snapshot
Second-Order Parameter-Free Duality Models in Semi-Infinite Minmax Fractional Programming
inferred← citeshttps://doi.org/10.1186/1029-242x-2012-298openalex-snapshot
Duality for nondifferentiable multiobjective higher-order symmetric programs over cones involving generalized ( F , α , ρ , d ) -convexity
inferred← citeshttps://doi.org/10.14317/jami.2013.835openalex-snapshot
SECOND ORDER NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEM INVOLVING SUPPORT FUNCTIONS
inferred← citeshttps://doi.org/10.1515/tmj-2015-0019openalex-snapshot
Generalized hybrid $B-(b,\rho,\theta,\tilde{p},\tilde{r})-$invexities and efficiency conditions for multiobjective fractional programming
inferred← citeshttps://doi.org/10.19139/soic.v2i4.92openalex-snapshot
Multiobjective Fractional Programming Problems and Second Order Generalized Hybrid Invexity Frameworks
inferred← citeshttps://doi.org/10.19139/soic.v3i3.139openalex-snapshot
Mathematical Programming Based on Sufficient Optimality Conditions and Higher Order Exponential Type Generalized Invexities
inferred← citeshttps://doi.org/10.3390/math11040889openalex-snapshot
Generalizations of Higher-Order Duality for Multiple Objective Nonlinear Programming under the Generalizations of Type-I Functions
inferred← citeshttps://doi.org/10.4067/s0719-06462015000100004openalex-snapshot
Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.6000/1927-5129.2016.12.45openalex-snapshot
Generalized Higher Order (φ, η, ω, π, ρ, θ, m)-Invexities in Parametric Optimality Conditions for Discrete Minmax Fractional 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.