On the public citation graph
Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
0 signed · 18 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-642-80684-1openalex-snapshot
Lectures on Mathematical Theory of Extremum Problems
inferredcites →https://doi.org/10.1007/bf00933793openalex-snapshot
Maximal vectors and multi-objective optimization
inferredcites →https://doi.org/10.1007/bf01442131openalex-snapshot
Pareto optimality in multiobjective problems
inferredcites →https://doi.org/10.1007/bfb0059450openalex-snapshot
A Course on Optimization and Best Approximation
inferredcites →https://doi.org/10.1016/0041-5553(65)90148-5openalex-snapshot
Extremum problems in the presence of restrictions
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/bf00935364openalex-snapshot
Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
inferred← citeshttps://doi.org/10.1007/bf00938628openalex-snapshot
Duality theorem of nondifferentiable convex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf00939284openalex-snapshot
Some properties of efficient solutions for vector optimization
inferred← citeshttps://doi.org/10.1007/bf00939770openalex-snapshot
On necessary optimality conditions in vector optimization problems
inferred← citeshttps://doi.org/10.1007/bf00939823openalex-snapshot
A survey of vector optimization in infinite-dimensional spaces, part 2
inferred← citeshttps://doi.org/10.1007/bf01460130openalex-snapshot
Optimality conditions in nondifferentiable programming and their applications to best approximations
inferred← citeshttps://doi.org/10.1007/s10898-004-6874-2openalex-snapshot
Optimality Conditions for Vector Optimization Problems of a Difference of Convex Mappings
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.04.041openalex-snapshot
A multi-objective optimization of type-2 fuzzy control speed in FPGAs
inferred← citeshttps://doi.org/10.1080/00207178608933568openalex-snapshot
An application-oriented, optimization-based methodology for interactive design of engineering systems†
inferred← citeshttps://doi.org/10.1080/02331939608844234openalex-snapshot
Multiplier rules for weak pareto optimization problems
inferred← citeshttps://doi.org/10.1109/43.3185openalex-snapshot
DELIGHT.SPICE: an optimization-based system for the design of integrated circuits
inferred← citeshttps://doi.org/10.17352/gje.000070openalex-snapshot
A review and evaluation of multi and many-objective optimization: Methods and algorithms
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.