The following pages link to David Bartl (Q417520):
Displaying 16 items.
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative (Q417521) (← links)
- A discrete variant of Farkas' lemma (Q1728176) (← links)
- A very short algebraic proof of the Farkas lemma (Q1935923) (← links)
- Can Pourciau's open mapping theorem be derived from Clarke's inverse mapping theorem easily? (Q1996298) (← links)
- Clarke Jacobians, Bouligand Jacobians, and compact connected sets of matrices (Q2166436) (← links)
- Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach (Q3439831) (← links)
- A Short Algebraic Proof of the Farkas Lemma (Q3608980) (← links)
- Every compact convex subset of matrices is the Clarke Jacobian of some Lipschitzian mapping (Q4957666) (← links)
- A discrete variant of Farkas' lemma and related results (Q5162596) (← links)
- A note on the short algebraic proof of Farkas' Lemma (Q5200325) (← links)
- (Q5293003) (← links)
- (Q5326648) (← links)
- On balanced games with infinitely many players: revisiting Schmeidler's result (Q6161904) (← links)
- A new algorithm for computing priority vector of pairwise comparisons matrix with fuzzy elements (Q6204998) (← links)
- Robustness of priority deriving methods for pairwise comparison matrices against rank reversal: a probabilistic approach (Q6491674) (← links)
- The \(\kappa\)-core and the \(\kappa\)-balancedness of TU games (Q6596976) (← links)
