On the public citation graph
Generalizations of Farkas’ Theorem
0 signed · 90 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-322-96210-2_2openalex-snapshot
Topological Vector Spaces
inferredcites →https://doi.org/10.1007/978-3-642-80730-5openalex-snapshot
Cones, Matrices and Mathematical Programming
inferredcites →https://doi.org/10.1007/bf00934807openalex-snapshot
Nonlinear programming in locally convex spaces
inferredcites →https://doi.org/10.1007/bf01584093openalex-snapshot
Linear inequalities, mathematical programming and matrix theory
inferredcites →https://doi.org/10.1016/0022-247x(69)90054-7openalex-snapshot
Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory
inferredcites →https://doi.org/10.1016/0022-247x(71)90020-5openalex-snapshot
Perron-Frobenius properties of Ax − λBx
inferredcites →https://doi.org/10.1016/0022-247x(71)90072-2openalex-snapshot
More on linear inequalities with applications to matrix theory
inferredcites →https://doi.org/10.1016/0024-3795(72)90016-xopenalex-snapshot
A generalization of irreducible monotonicity
inferredcites →https://doi.org/10.2307/2342801openalex-snapshot
Studies in Linear and Non-Linear Programming.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/oca.2089openalex-snapshot
Constrained Markov control processes with randomized discounted cost criteria: infinite linear programming approach
inferred← citeshttps://doi.org/10.1002/zamm.19800600102openalex-snapshot
Strong Vector Minimization and Duality
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5612openalex-snapshot
Further Generalizations of Farkas' Theorem and Their Applications in Optimal Control
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-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot
Farkas Lemma: Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-031-37260-5_5openalex-snapshot
Measure Solutions for Neutral Evolution Equations
inferred← citeshttps://doi.org/10.1007/bf00939223openalex-snapshot
Pshenichnyi's theorem for vector minimization
inferred← citeshttps://doi.org/10.1007/bf01589443openalex-snapshot
A simple constraint qualification in infinite dimensional programming
inferred← citeshttps://doi.org/10.1007/bf01874130openalex-snapshot
Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
inferred← citeshttps://doi.org/10.1007/bf02214077openalex-snapshot
Existence and uniqueness of an invariant probability for a class of Feller Markov chains
inferred← citeshttps://doi.org/10.1007/jhep07(2013)099openalex-snapshot
Precise lower bound on Monster brane boundary entropy
inferred← citeshttps://doi.org/10.1007/jhep10(2013)180openalex-snapshot
Constraints on 2d CFT partition functions
inferred← citeshttps://doi.org/10.1007/s11117-005-0042-xopenalex-snapshot
Necessary and Sufficient Conditions for Solving Infinite-Dimensional Linear Inequalities
inferred← citeshttps://doi.org/10.1007/s11117-009-0032-5openalex-snapshot
Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
inferred← citeshttps://doi.org/10.1007/s11228-020-00537-1openalex-snapshot
A Constant Rank Constraint Qualification in Continuous-Time Nonlinear Programming
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/s43069-023-00279-4openalex-snapshot
Lagrangian Duality in Convex Conic Programming with Simple Proofs
inferred← citeshttps://doi.org/10.1016/0022-247x(80)90278-4openalex-snapshot
Optimality conditions and duality in continuous programming I. Convex programs and a theorem of the alternative
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90009-4openalex-snapshot
Linear programming with matrix variables
inferred← citeshttps://doi.org/10.1016/0167-6377(84)90071-3openalex-snapshot
Modified Kuhn-tucker conditions when a minimum is not attained
inferred← citeshttps://doi.org/10.1016/0167-7152(95)00146-8openalex-snapshot
Existence of bounded invariant probability densities for Markov chains
inferred← citeshttps://doi.org/10.1016/j.econlet.2024.112086openalex-snapshot
Equilibria in a large economy with externalities, non-convex preferences and an infinite-dimensional commodity space via relaxation
inferred← citeshttps://doi.org/10.1016/j.exco.2021.100006openalex-snapshot
On the sufficiency of K -positivity for truncated compactly supported generalized moment problems
inferred← citeshttps://doi.org/10.1016/j.orl.2005.05.013openalex-snapshot
On the consistency of the mass transfer problem
inferred← citeshttps://doi.org/10.1017/s0004972700023431openalex-snapshot
Lagrangean conditions and quasiduality
inferred← citeshttps://doi.org/10.1017/s0269964800004289openalex-snapshot
Invariant Probabilities with Geometric Tail
inferred← citeshttps://doi.org/10.1023/a:1005826226226openalex-snapshot
Linear Programming Approximations for Markov Control Processes in Metric Spaces
inferred← citeshttps://doi.org/10.1063/1.2837427openalex-snapshot
Useful entanglement can be extracted from all nonseparable states
inferred← citeshttps://doi.org/10.1080/00036818208839417openalex-snapshot
Images of cones under linear mappings
inferred← citeshttps://doi.org/10.1080/00207179208934289openalex-snapshot
Control system design via infinite linear programming
inferred← citeshttps://doi.org/10.1080/01630568008816073openalex-snapshot
Lagrangian duality for a class of infinite programming problems
inferred← citeshttps://doi.org/10.1080/01630568908816310openalex-snapshot
On gwinner's paper "results of emas type"
inferred← citeshttps://doi.org/10.1080/01630568908816317openalex-snapshot
The conjugate of a difference of functions defined on different spaces
inferred← citeshttps://doi.org/10.1080/02331934.2019.1653294openalex-snapshot
Necessary conditions for continuous-time optimization under the Mangasarian–Fromovitz constraint qualification
inferred← citeshttps://doi.org/10.1080/02331938308842884openalex-snapshot
Differentiable Programming in Banach Spaces
inferred← citeshttps://doi.org/10.1080/02331938408842969openalex-snapshot
Zum Satz von Tucker bei linearen Optimalproblemen in halbgeordneten Vektorräumen
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
inferred← citeshttps://doi.org/10.1080/10556780903191165openalex-snapshot
Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
inferred← citeshttps://doi.org/10.1088/1361-6560/ab0a2eopenalex-snapshot
Guaranteed ε -optimal solutions with the linear optimizer ART3+O
inferred← citeshttps://doi.org/10.1090/s0002-9939-98-04389-5openalex-snapshot
A theorem of the alternative in Banach lattices
inferred← citeshttps://doi.org/10.1103/physreva.86.052115openalex-snapshot
All entangled states display some hidden nonlocality
inferred← citeshttps://doi.org/10.1103/physrevlett.100.090403openalex-snapshot
All Bipartite Entangled States Display Some Hidden Nonlocality
inferred← citeshttps://doi.org/10.1103/physrevlett.96.150501openalex-snapshot
All Bipartite Entangled States Are Useful for Information Processing
inferred← citeshttps://doi.org/10.1109/9.388700openalex-snapshot
A new Farkas lemma for positive semidefinite matrices
inferred← citeshttps://doi.org/10.1109/cdc.1990.203934openalex-snapshot
Design of non-overshooting feedback control systems
inferred← citeshttps://doi.org/10.1109/cdc.1995.480242openalex-snapshot
Linear programming with positive semi definite matrices
inferred← citeshttps://doi.org/10.1109/cdc.1996.577443openalex-snapshot
Existence of solutions to the Poisson equation in L/sub p/ spaces
inferred← citeshttps://doi.org/10.1109/cdc.1997.657116openalex-snapshot
Linear programming approximations for Markov control processes in metric spaces
inferred← citeshttps://doi.org/10.1109/cdc.1999.832923openalex-snapshot
Semidefinite programming duality and linear system theory: connections and implications for computation
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760898openalex-snapshot
Estimation of consistent parameter sets for continuous-time nonlinear systems using occupation measures and LMI relaxations
inferred← citeshttps://doi.org/10.1109/tac.2002.806652openalex-snapshot
Semidefinite programming duality and linear time-invariant systems
inferred← citeshttps://doi.org/10.1112/s0024611598000380openalex-snapshot
Existence and Uniqueness of Fixed Points for Markov Operators and Markov Processes
inferred← citeshttps://doi.org/10.1137/0329062openalex-snapshot
A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory
inferred← citeshttps://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/140992047openalex-snapshot
Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
inferred← citeshttps://doi.org/10.1137/16m1062375openalex-snapshot
An Optimal Control Problem Governed by a Regularized Phase-Field Fracture Propagation Model
inferred← citeshttps://doi.org/10.1137/s0363012994268321openalex-snapshot
A Farkas lemma Without A Standard Closure Condition
inferred← citeshttps://doi.org/10.1137/s0363012995292238openalex-snapshot
Infinite Linear Programming and Multichain Markov Control Processes in Uncountable Spaces
inferred← citeshttps://doi.org/10.1137/s0363012999361627openalex-snapshot
Constrained Average Cost Markov Control Processes in Borel Spaces
inferred← citeshttps://doi.org/10.1137/s1052623497315768openalex-snapshot
Approximation Schemes for Infinite Linear Programs
inferred← citeshttps://doi.org/10.1214/aop/1008956338openalex-snapshot
On the existence of a quasistationary measure for a Markov chain
inferred← citeshttps://doi.org/10.1287/moor.2025.0926openalex-snapshot
On the Equivalence of Zero-Sum Games and Conic Programs
inferred← citeshttps://doi.org/10.2140/gt.2015.19.1895openalex-snapshot
The invariant measures of some infinite interval exchange maps
inferred← citeshttps://doi.org/10.2298/fil2211797jopenalex-snapshot
Saddle point optimality criteria and duality for convex continuous-time programming problem
inferred← citeshttps://doi.org/10.3982/ecta15011openalex-snapshot
Social Discounting and Intergenerational Pareto
inferred← citeshttps://doi.org/10.48550/arxiv.0810.5400openalex-snapshot
Correlations, Bell Inequality Violation & Quantum Entanglement
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2122openalex-snapshot
Precise lower bound on Monster brane boundary entropy
inferred← citeshttps://doi.org/10.48550/arxiv.1802.03378openalex-snapshot
Necessary Optimality Conditions for Continuous-Time Optimization Problems with Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.5540/03.2018.006.01.0340openalex-snapshot
Condições Necessárias para Problemas de Otimização com Tempo Contínuo sob Regularidade Tipo Independência Linear
inferred← citeshttps://doi.org/10.5540/tema.2019.020.01.15openalex-snapshot
A Full Rank Condition for Continuous-Time Optimization Problems with Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.68381/jca04007openalex-snapshot
Cone-Constrained Linear Equations in Banach Spaces
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.