Two Consequences of the Transposition Theorem on Linear Inequalities
From MaRDI portal
Cited in
(22)- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Lexicographical separation in \({\mathbb{R}}^ n\)
- Harsanyi's social aggregation theorem for state-contingent alternatives
- \textsc{LTL} falsification in infinite-state systems
- Automatic discovery of fair paths in infinite-state transition systems
- Logics of imprecise comparative probability
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A complex transposition theorem with applications to complex programming
- Theorems of the alternative for complex linear inequalities
- A convergent splitting of matrices
- Perron-Frobenius properties of \(Ax-\lambda Bx\)
- Linear equations over cones with interior: a solvability theorem with applications to matrix theory
- Optimality criteria for a class of non differentiable non-linear programs
- Generic property of the partial calmness condition for bilevel programming problems
- A New Proof of the Transposition Theorem
- Optimizing flow thinning protection in multicommodity networks with variable link capacity
- Collusion-proof mechanisms for full surplus extraction
- Automatic synthesis of k-inductive piecewise quadratic invariants for switched affine control programs
- Propositional logics for the Lawvere quantale
- Portfolio constraints, differences in beliefs and bubbles
- A weak characterisation of the Delaunay triangulation
This page was built for publication: Two Consequences of the Transposition Theorem on Linear Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5803259)
