On the public citation graph
On semi-infinite systems of linear inequalities
0 signed · 24 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.1073/pnas.48.5.783openalex-snapshot
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12000-2openalex-snapshot
On the intersections of cones and subspaces
inferredcites →https://doi.org/10.1090/s0002-9904-1969-12153-1openalex-snapshot
Duality and asymptotic solvability over cones
inferredcites →https://doi.org/10.21236/ad0673968openalex-snapshot
ON SOME NONSTANDARD SEMI-INFINITE PROGRAMMING 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.1998.6189openalex-snapshot
On Duality in Semi-Infinite Programming and Existence Theorems for Linear Inequalities
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/978-1-4757-3403-4_1openalex-snapshot
On the 1962–1972 Decade of Semi-Infinite Programming: A Subjective View
inferred← citeshttps://doi.org/10.1007/978-3-642-46414-0_18openalex-snapshot
Representation of Convex Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_1openalex-snapshot
Ascent Ray Theorems and Some Applications
inferred← citeshttps://doi.org/10.1007/bf00935176openalex-snapshot
On equating the difference between optimal and marginal values of general convex programs
inferred← citeshttps://doi.org/10.1007/bf00935755openalex-snapshot
The limiting Lagrangian as a consequence of Helly's theorem
inferred← citeshttps://doi.org/10.1007/bf01415997openalex-snapshot
Semi-infinite programming duality for order restricted statistical inference models
inferred← citeshttps://doi.org/10.1007/bf01448186openalex-snapshot
Constructing a perfect duality in infinite programming
inferred← citeshttps://doi.org/10.1007/bf01582242openalex-snapshot
On constraint sets of infinite linear programs over ordered fields
inferred← citeshttps://doi.org/10.1007/bf02756833openalex-snapshot
An extension of a theorem of Jeroslow and Kortanek
inferred← citeshttps://doi.org/10.1016/0022-247x(74)90222-4openalex-snapshot
A note on infinite systems of linear inequalities in Rn
inferred← citeshttps://doi.org/10.1016/0022-247x(80)90228-0openalex-snapshot
Lexicographic multipliers
inferred← citeshttps://doi.org/10.1016/0024-3795(75)90127-5openalex-snapshot
Theorems on the dimension of convex sets
inferred← citeshttps://doi.org/10.1016/0377-2217(87)90270-0openalex-snapshot
Convergence results and numerical experiments on a linear programming hybrid algorithm
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1287/moor.2014.0665openalex-snapshot
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex 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.