On the public citation graph
Duality theorem of nondifferentiable convex multiobjective programming
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.
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/978-3-7091-2652-3_9openalex-snapshot
Necessary and Sufficient Conditions for Optimality
inferredcites →https://doi.org/10.1007/bf00933437openalex-snapshot
Duality theory in multiobjective programming
inferredcites →https://doi.org/10.1007/bf00933511openalex-snapshot
Some minimax theorems in vector-valued functions
inferredcites →https://doi.org/10.1007/bf00933935openalex-snapshot
Necessary conditions for optimality of nondifferentiable convex multiobjective programming
inferredcites →https://doi.org/10.1007/bf00934330openalex-snapshot
Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
inferredcites →https://doi.org/10.1007/bf00935888openalex-snapshot
Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
inferredcites →https://doi.org/10.1007/bf01442131openalex-snapshot
Pareto optimality in multiobjective problems
inferredcites →https://doi.org/10.1016/0022-247x(77)90183-4openalex-snapshot
A subgradient duality theorem
inferredcites →https://doi.org/10.1016/0022-247x(79)90228-2openalex-snapshot
More on subgradient duality
inferredcites →https://doi.org/10.1017/s1446788700024927openalex-snapshot
Duality theorems and an optimality condition for non-differentiable convex programming
inferredcites →https://doi.org/10.1090/qam/135625openalex-snapshot
A duality theorem for non-linear programming
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.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0080openalex-snapshot
ϵ-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function
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/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46618-2_10openalex-snapshot
Duality in Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf00939803openalex-snapshot
Optimality for set functions with values in ordered vector spaces
inferred← citeshttps://doi.org/10.1007/bf00940466openalex-snapshot
?-duality theorem of nondifferentiable nonconvex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf00941889openalex-snapshot
Optimality conditions and duality in subdifferentiable multiobjective fractional programming
inferred← citeshttps://doi.org/10.1007/bf01442188openalex-snapshot
AnN-person noncooperative discounted vector-valued dynamic game with a metric space
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/bf03398527openalex-snapshot
On Sufficiency and Duration in Nonsmooth Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/bf03398544openalex-snapshot
Duality For Nonsmooth Multiobjective Fractional Programs Under Generalized (F, ρ)-Convexity
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90017-xopenalex-snapshot
On a D-solution of a cooperative m-person discounted Markov game
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90084-4openalex-snapshot
Moreau-Rockafellar type theorem for convex set functions
inferred← citeshttps://doi.org/10.1016/0898-1221(89)90137-5openalex-snapshot
Vector saddle-point and distributed parameter differential games
inferred← citeshttps://doi.org/10.1051/ro/1994280403991openalex-snapshot
Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
inferred← citeshttps://doi.org/10.1080/01630569208816480openalex-snapshot
Axiomatic approach to duality in optimization
inferred← citeshttps://doi.org/10.1080/02331939608844234openalex-snapshot
Multiplier rules for weak pareto optimization problems
inferred← citeshttps://doi.org/10.1109/icmse.2007.4421909openalex-snapshot
Duality Theorems of Multiobjective Programming for a Class of Generalized Convex Functions
inferred← citeshttps://doi.org/10.1142/s0217595922500439openalex-snapshot
Wolfe-Type Duality for Mathematical Programs with Switching Constraints
inferred← citeshttps://doi.org/10.1155/2013/527183openalex-snapshot
New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem
inferred← citeshttps://doi.org/10.11650/tjm.1.1997.1419openalex-snapshot
OPTIMALITY CONDITIONS FOR SEMI-PREINVEX PROGRAMMING
inferred← citeshttps://doi.org/10.11650/twjm/1500406118openalex-snapshot
OPTIMALITY CONDITIONS FOR SEMI-PREINVEX PROGRAMMING
inferred← citeshttps://doi.org/10.1515/jaa.2010.012openalex-snapshot
On multiobjective nonlinear programming with support 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.