Necessary and sufficient conditions for solving infinite-dimensional linear inequalities

DOI10.1007/s11117-005-0042-xzbMath1151.90024OpenAlexW2076621961MaRDI QIDQ850601

Stephen A. Clark

Publication date: 3 November 2006

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-005-0042-x

zbMATH Keywords

positive conelinear inequalityfeasible solutionAdjoint operatorMinkowski-Farkas LemmaTheorem of the Alternative

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Perturbation analysis of sub/super hedging problems ⋮ Detecting profitable deviations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The valuation problem in arbitrage price theory
• Arbitrage and equilibrium in economies with infinitely many commodities
• A generalization of the Farkas lemma and applications to convex programming
• Theorems of the alternative and duality
• Further generalizations of Farkas' theorem and their applications in optimal control
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• No arbitrage: On the work of David Kreps
• On the existence of solutions for linear inequality systems
• The random utility model with an infinite choice space
• Arbitrage approximation theory
• On infinite systems of linear inequalities
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Asymptotic duality over closed convex sets
• A Simple Proof of Farkas' Lemma
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• A Farkas lemma Without A Standard Closure Condition
• Programmes in Paired Spaces
• A simple algebraic proof of Farkas's lemma and related theorems
• A multivalued approach to the Farkas lemma
• Generalizations of Farkas’ Theorem
• A theorem of the alternative in Banach lattices
• Classroom Note:An Elementary Proof of Farkas' Lemma
• A generl farkas type lemma
• Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
• On the intersections of cones and subspaces
• Convex Analysis
• A Note on Farkas Lemmas over Cone Domains
• An Infinite-Dimensional LP Duality Theorem
• An Extension of the Farkas Theorem

This page was built for publication: Necessary and sufficient conditions for solving infinite-dimensional linear inequalities