On the public citation graph
Lagrange Multipliers and saddle points in multiobjective programming
0 signed · 66 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-1-4684-8395-6openalex-snapshot
Multiple-Criteria Decision Making: "Concepts, Techniques, And Extensions"
inferredcites →https://doi.org/10.1007/978-3-7091-2822-0openalex-snapshot
Mathematics of Multi Objective Optimization
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/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferredcites →https://doi.org/10.1007/bf00938399openalex-snapshot
Geometric consideration of duality in vector optimization
inferredcites →https://doi.org/10.1007/bf00940198openalex-snapshot
Existence and Lagrangian duality for maximizations of set-valued functions
inferredcites →https://doi.org/10.1007/bf00940312openalex-snapshot
Some minimax problems of vector-valued functions
inferredcites →https://doi.org/10.1007/bf00940575openalex-snapshot
A generalization of a minimax theorem of Fan via a theorem of the alternative
inferredcites →https://doi.org/10.1016/0305-0548(93)90042-hopenalex-snapshot
Nonlinear programming: theory and algorithms
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1080/01630568708816230openalex-snapshot
Weak minimization and duality
inferredcites →https://doi.org/10.1080/01630569008816360openalex-snapshot
Quasimin and quasisaddlepoint for vector optimization
inferredcites →https://doi.org/10.1080/02331938608843188openalex-snapshot
On Duality for Weakly Minimized Vector Valued Optimization Problems
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.5568openalex-snapshot
Lagrangian Multipliers, Saddle Points, and Duality in Vector Optimization of Set-Valued Maps
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_1openalex-snapshot
Theory of Vector Optimization
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-15663-2_5openalex-snapshot
Multicriteria Decision Making
inferred← citeshttps://doi.org/10.1007/bf02579060openalex-snapshot
Duality and saddle-points for convex-like vector optimization problems on real linear spaces
inferred← citeshttps://doi.org/10.1007/s10898-022-01250-zopenalex-snapshot
Some saddle-point theorems for vector-valued functions
inferred← citeshttps://doi.org/10.1007/s10957-004-1184-xopenalex-snapshot
Proper Efficiency in Vector Optimization on Real Linear Spaces
inferred← citeshttps://doi.org/10.1007/s10957-004-1716-4openalex-snapshot
New Generalized Convexity Notion for Set-Valued Maps and Application to Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-007-9173-5openalex-snapshot
Moreau–Rockafellar Theorems for Nonconvex Set-Valued Maps
inferred← citeshttps://doi.org/10.1007/s10957-007-9221-1openalex-snapshot
Lagrangian Duality and Cone Convexlike Functions
inferred← citeshttps://doi.org/10.1007/s10957-012-0007-8openalex-snapshot
Generalized Lagrange Function and Generalized Weak Saddle Points for a Class of Multiobjective Fractional Optimal Control Problems
inferred← citeshttps://doi.org/10.1007/s10957-012-0045-2openalex-snapshot
Scalarization of Set-Valued Optimization Problems with Generalized Cone Subconvexlikeness in Real Ordered Linear Spaces
inferred← citeshttps://doi.org/10.1007/s11424-017-6085-9openalex-snapshot
Saddle Point Criteria in Nonsmooth Semi-Infinite Minimax Fractional Programming Problems
inferred← citeshttps://doi.org/10.1007/s11750-026-00716-7openalex-snapshot
A note on constraint qualification for saddle point conditions involving convex and linear affine functions
inferred← citeshttps://doi.org/10.1007/s40096-014-0128-3openalex-snapshot
Sequential optimality conditions for multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.09.013openalex-snapshot
Saddle points criteria in nondifferentiable multiobjective programming with V -invex functions via an η -approximation method
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.11.042openalex-snapshot
Optimality and mixed saddle point criteria in multiobjective optimization
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.12.050openalex-snapshot
Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00444-7openalex-snapshot
Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness
inferred← citeshttps://doi.org/10.1016/s0893-9659(03)80035-6openalex-snapshot
Efficient and weak efficient points in vector optimization with generalized cone convexity
inferred← citeshttps://doi.org/10.1023/a:1017526724872openalex-snapshot
About a Gap between Multiobjective Optimization and Scalar Optimization
inferred← citeshttps://doi.org/10.1023/a:1021780423989openalex-snapshot
On Classes of Generalized Convex Functions, Gordan–Farkas Type Theorems, and Lagrangian Duality
inferred← citeshttps://doi.org/10.1023/a:1022676013609openalex-snapshot
Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps
inferred← citeshttps://doi.org/10.1023/a:1022689517921openalex-snapshot
Characterizations of the Benson Proper Efficiency for Nonconvex Vector Optimization
inferred← citeshttps://doi.org/10.1023/b:jota.0000005449.20614.41openalex-snapshot
Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems
inferred← citeshttps://doi.org/10.1023/b:jota.0000037602.13941.edopenalex-snapshot
Proper Efficiency in Vector Optimization on Real Linear Spaces
inferred← citeshttps://doi.org/10.1080/00207160.2014.925191openalex-snapshot
Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
inferred← citeshttps://doi.org/10.1080/01630560701249970openalex-snapshot
Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems
inferred← citeshttps://doi.org/10.1080/01630560802099274openalex-snapshot
Two Types of Approximate Saddle Points
inferred← citeshttps://doi.org/10.1080/01630563.2024.2305347openalex-snapshot
Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints
inferred← citeshttps://doi.org/10.1080/02331931003610781openalex-snapshot
Conic separation for vector optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2023.2187660openalex-snapshot
Image regularity conditions for nonconvex multiobjective optimization problems with applications
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/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1080/02331939908844439openalex-snapshot
Global efficiency in multiobjective programming*
inferred← citeshttps://doi.org/10.1142/s0219622014500540openalex-snapshot
Second- and First-Order Optimality Conditions in Vector Optimization
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.1693openalex-snapshot
Global and local optimality conditions in set‐valued optimization problems
inferred← citeshttps://doi.org/10.1360/n012019-00042openalex-snapshot
The linear scalarizations and Lagrange multipliers for vector optimization
inferred← citeshttps://doi.org/10.14736/kyb-2016-3-0359openalex-snapshot
Saddle point criteria for second order $\eta$-approximated vector optimization problems
inferred← citeshttps://doi.org/10.1515/jaa-2020-2042openalex-snapshot
Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps
inferred← citeshttps://doi.org/10.20944/preprints202309.1330.v1openalex-snapshot
Constraint Qualifications for Vector Optimization Problemsin Real Topological Spaces
inferred← citeshttps://doi.org/10.3390/axioms12080783openalex-snapshot
Constraint Qualifications for Vector Optimization Problems in Real Topological Spaces
inferred← citeshttps://doi.org/10.3390/math11132928openalex-snapshot
On Sub Convexlike Optimization Problems
inferred← citeshttps://doi.org/10.3844/jmssp.2019.86.98openalex-snapshot
E-Saddle Point Criteria for E-differentiable Vector Optimization Problems with Inequality and Equality Constraints
inferred← citeshttps://doi.org/10.3934/jimo.2014.10.1225openalex-snapshot
Lower semicontinuity of the solution mapping to a parametric generalized vectorequilibrium problem
inferred← citeshttps://doi.org/10.3934/jimo.2015.11.673openalex-snapshot
Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
inferred← citeshttps://doi.org/10.4172/2168-9679.1000263openalex-snapshot
On Duality of Multiobjective Rough Convex Programming Problems
inferred← citeshttps://doi.org/10.4236/am.2013.44101openalex-snapshot
A Note on the Guignard Constraint Qualification and the Guignard Regularity Condition in Vector Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1706.03728openalex-snapshot
Lagrangian Multipliers for Presubconvexlike Optimization Problems of Set Valued 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.