On the public citation graph
Farkas-Minkowski systems in semi-infinite programming
0 signed · 60 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.1002/nav.3800160104openalex-snapshot
On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
inferredcites →https://doi.org/10.1007/bf01448186openalex-snapshot
Constructing a perfect duality in infinite programming
inferredcites →https://doi.org/10.1007/bfb0003880openalex-snapshot
Duality theory of semi-infinite programming
inferredcites →https://doi.org/10.1007/bfb0006502openalex-snapshot
Semi-infinite programming: Conditions of optimality and applications
inferredcites →https://doi.org/10.1016/0022-247x(68)90255-2openalex-snapshot
On infinite systems of linear inequalities
inferredcites →https://doi.org/10.1057/jors.1977.183openalex-snapshot
Non-Linear Programming—Theory and Methods
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.2307/3008856openalex-snapshot
Non-Linear Programming -- Theory and Methods
inferredcites →https://doi.org/10.2307/3008903openalex-snapshot
Optimization Theory: The Finite Dimensional Case
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_133openalex-snapshot
Farkas lemmaFarkas lemma; Fourier–Motzkin elimination method; Fractional programming; Global optimization: Envelope representation; Gröbner bases for polynomial equations; Lagrangian duality: Basics; Least-index anticycling rules; Theorems of the alternative and optimizationFARKAS LEMMA:…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot
Farkas Lemma: Generalizations
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_6openalex-snapshot
Limiting Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_2openalex-snapshot
Conditions for the Closedness of the Characteristic Cone Associated with an Infinite Linear System
inferred← citeshttps://doi.org/10.1007/bf00938312openalex-snapshot
Optimal value function in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf00940642openalex-snapshot
Strong unicity and alternation for linear optimization
inferred← citeshttps://doi.org/10.1007/bf01061299openalex-snapshot
Linear inequalities in mathematical programming and pattern recognition
inferred← citeshttps://doi.org/10.1007/bf01259337openalex-snapshot
A note about linear inequality systems and duality
inferred← citeshttps://doi.org/10.1007/bf01740508openalex-snapshot
Geometric fundamentals of the simplex method in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02192650openalex-snapshot
Topological stability of linear semi-infinite inequality systems
inferred← citeshttps://doi.org/10.1007/bf02591906openalex-snapshot
Optimality conditions for nondifferentiable convex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bf02888777openalex-snapshot
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
inferred← citeshttps://doi.org/10.1007/bf02889704openalex-snapshot
Una caracterización dual de optimalidad para optimización convexa
inferred← citeshttps://doi.org/10.1007/bf02895787openalex-snapshot
Dualidad de Haar y problemas de momentos
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/s10013-020-00415-1openalex-snapshot
Selected Applications of Linear Semi-Infinite Systems Theory
inferred← citeshttps://doi.org/10.1007/s10107-024-02092-1openalex-snapshot
A characterization of maximal homogeneous-quadratic-free sets
inferred← citeshttps://doi.org/10.1007/s10479-018-2987-8openalex-snapshot
Recent contributions to linear semi-infinite optimization: an update
inferred← citeshttps://doi.org/10.1007/s10898-010-9561-5openalex-snapshot
Necessary optimality conditions for nonsmooth semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/s11590-017-1193-yopenalex-snapshot
Efficient and weakly efficient solutions for the vector topical optimization
inferred← citeshttps://doi.org/10.1007/s11750-014-0319-yopenalex-snapshot
Farkas’ lemma: three decades of generalizations for mathematical optimization
inferred← citeshttps://doi.org/10.1007/s11750-026-00713-wopenalex-snapshot
A brief tutorial on semi-infinite optimization: the model, applications and basic mathematical constructions
inferred← citeshttps://doi.org/10.1007/s12597-025-00971-5openalex-snapshot
$$\mathcal {E}$$-LU-optimal solution for nonsmooth semi-infinite interval-valued problems
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90024-9openalex-snapshot
A theory of linear inequality systems
inferred← citeshttps://doi.org/10.1016/0196-8858(87)90005-4openalex-snapshot
Boundedness relations in linear semi-infinite programming
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.04.071openalex-snapshot
On strong and total Lagrange duality for convex optimization problems
inferred← citeshttps://doi.org/10.1016/j.na.2007.05.021openalex-snapshot
New regularity conditions for strong and total Fenchel–Lagrange duality in infinite dimensional spaces
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00241-3openalex-snapshot
Locally polyhedral linear inequality systems
inferred← citeshttps://doi.org/10.1051/ro/2018028openalex-snapshot
ϵ-Efficient solutions in semi-infinite multiobjective optimization
inferred← citeshttps://doi.org/10.1080/02331938708843278openalex-snapshot
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1080/02331939008843617openalex-snapshot
Stability in disjunctive linear optimization I: continuity of the feasible set
inferred← citeshttps://doi.org/10.1080/02331939208843816openalex-snapshot
Dimension and finite reduction in linear semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331939208843842openalex-snapshot
An optimality test for semi-infinite linear programming
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/1036001openalex-snapshot
An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
inferred← citeshttps://doi.org/10.1137/s0895479895259766openalex-snapshot
Stability Theory for Linear Inequality Systems
inferred← citeshttps://doi.org/10.1137/s1052623402401944openalex-snapshot
Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
inferred← citeshttps://doi.org/10.1137/s1052623499355247openalex-snapshot
Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.32508/stdjet.v3isi3.637openalex-snapshot
Necessary optimality conditions in nonsmooth semi-infinite multiobjective optimization under metric subregularity
inferred← citeshttps://doi.org/10.3389/fams.2016.00014openalex-snapshot
Closedness Type Regularity Conditions in Convex Optimization and Beyond
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.