Solvability and Consistency for Linear Equations and Inequalities
From MaRDI portal
Publication:3232291
DOI10.2307/2310345zbMATH Open0070.25001OpenAlexW4237055776MaRDI QIDQ3232291FDOQ3232291
Authors: Harold W. Kuhn
Publication date: 1956
Full work available at URL: https://doi.org/10.2307/2310345
Cited In (28)
- Do local majorities force a global majority?
- Solvability and consistency for infinite systems of linear inequalities
- A dynamic epistemic framework for reasoning about conformant probabilistic plans
- A unified approach for finding real and integer solutions to systems of linear inequalities
- Recognizing arithmetic straight lines and planes
- Ein Erweiterungssatz für monotone Mengen
- Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
- How to cut a cake with a Gram matrix
- Signed difference analysis: theory and application.
- Sufficient algebraic conditions for stability of cones of polynomials
- On linear systems containing strict inequalities
- Binary choice probabilities and rankings
- Topological properties of Hausdorff discretization, and comparison to other discretization schemes.
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- On the posets \((\mathcal W_2^k,<)\) and their connections with some homogeneous inequalities of degree 2
- Likelihood relations and stochastic preferences
- A logic for reasoning about probabilities
- Nonstandard nontransitive utility on mixture sets
- Title not available (Why is that?)
- On finite linear systems containing strict inequalities
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- A model for ordered metric scaling by comparison of intervals
- Graph-theoretical properties of parallelism in the digital plane
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Binary choice models with discrete regressors: identification and misspecification
- The geometry of solvability and duality in linear programming
- A characterisation of all feasible solutions to an integer program
- Fourier-Motzkin elimination and its dual
This page was built for publication: Solvability and Consistency for Linear Equations and Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3232291)