On the public citation graph
Unicity in linear optimization
0 signed · 27 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.1006/jath.1993.1099openalex-snapshot
Uniqueness in Linear Semi-infinite Optimization
inferredcites →https://doi.org/10.1007/978-1-4613-8295-9_12openalex-snapshot
Constructive Function Theory
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0_15openalex-snapshot
Unicity in Semi-Infinite Optimization
inferredcites →https://doi.org/10.1007/978-3-322-93108-5openalex-snapshot
Numerische Methoden der Approximation und semi-infiniten Optimierung
inferredcites →https://doi.org/10.1007/bf00935322openalex-snapshot
A refinement of an optimality criterion and its application to parametric programming
inferredcites →https://doi.org/10.1007/bf00940517openalex-snapshot
Conditions for the uniqueness of the optimal solution in linear semi-infinite programming
inferredcites →https://doi.org/10.1007/bf00940642openalex-snapshot
Strong unicity and alternation for linear optimization
inferredcites →https://doi.org/10.1007/bf01442122openalex-snapshot
Farkas-Minkowski systems in semi-infinite programming
inferredcites →https://doi.org/10.1016/0024-3795(79)90014-4openalex-snapshot
Uniqueness of solution in linear programming
inferredcites →https://doi.org/10.1016/0196-8858(87)90005-4openalex-snapshot
Boundedness relations in linear semi-infinite programming
inferredcites →https://doi.org/10.1080/01630568208816130openalex-snapshot
A local version of haar's theorem in approximation theory
inferredcites →https://doi.org/10.1080/01630568508816209openalex-snapshot
Global unicity in semi-infinite optimization
inferredcites →https://doi.org/10.1287/mnsc.12.1.113openalex-snapshot
On Representations of Semi-Infinite Programs which Have No Duality Gaps
inferredcites →https://doi.org/10.1287/mnsc.9.2.209openalex-snapshot
Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
inferredcites →https://doi.org/10.1515/crll.1913.143.128openalex-snapshot
Bedingt konvergente Reihen und konvexe Systeme.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_1openalex-snapshot
A Comprehensive Survey of Linear Semi-Infinite Optimization Theory
inferred← citeshttps://doi.org/10.1007/s00186-015-0513-1openalex-snapshot
First order solutions in conic programming
inferred← citeshttps://doi.org/10.1007/s002459900080openalex-snapshot
Unicity Results for General Linear Semi-Infinite Optimization Problems Using a New Concept of Active Constraints
inferred← citeshttps://doi.org/10.1007/s10479-007-0197-xopenalex-snapshot
Higher-order optimality conditions for strict local minima
inferred← citeshttps://doi.org/10.1007/s10898-011-9768-0openalex-snapshot
On stable uniqueness in linear semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10957-023-02256-7openalex-snapshot
Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s11117-026-01210-xopenalex-snapshot
Higher-order optimality conditions for strict minimality in general nonsmooth vector optimization problems with mixed constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.09.006openalex-snapshot
Constraint qualifications in linear vector semi-infinite optimization
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322155openalex-snapshot
On the weakest constraint qualification for sharp local minimizers
inferred← citeshttps://doi.org/10.1109/cso.2012.96openalex-snapshot
Higher-order Optimality Conditions of Strict Local Minima in Optimization Problems
inferred← citeshttps://doi.org/10.1137/s1052623402401579openalex-snapshot
Extended Active Constraints in Linear Optimization with Applications
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.