scientific article; zbMATH DE number 3022422

From MaRDI portal
Revision as of 05:07, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5760872

zbMath0014.24601MaRDI QIDQ5760872

Theodore S. Motzkin

Publication date: 1936


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (41)

Motzkin decomposition of closed convex setsMinimization of semicoercive functions: a generalization of Fichera's existence theorem for the Signorini problemFinding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solutionOn Pólya frequency functions. I. The totally positive functions and their Laplace transformsUniqueness of integer solution of linear equationsMaximal Separation Theorems for Convex SetsHySAT: An efficient proof engine for bounded model checking of hybrid systemsPareto adaptive robust optimality via a Fourier-Motzkin elimination lensCombinatorics and Hodge theoryCombinatorial geometry takes the leadIrreducibly inconsistent systems of linear inequalitiesOn the stability of the Motzkin representation of closed convex setsEvenly convex sets, and evenly quasiconvex functions, revisitedRigorous filtering using linear relaxationsA stable theorem of the alternative: An extension of the Gordan theoremComputing the Maximum Volume Inscribed Ellipsoid of a Polytopic ProjectionMotzkin predecomposable setsA weak characterisation of the Delaunay triangulationSpira's theorems on complete linear proofs of systems of linear inequalitiesProof synthesis and reflection for linear arithmeticOn OM-decomposable setsA discrete variant of Farkas' lemma and related resultsOn comparison of different sets of units used for improving the frontier in DEA modelsDescription of the optimal solution set of the linear programming problem and the dimension formulaA conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper boundsLinear quantifier eliminationApplications of symmetric derivatives in mathematical programmingOn M-predecomposable setsMultivalued convexity and optimization: A unified approach to inequality and equality constraintsA counterexample to Greenberg's algorithm for solving linear inequalitiesOn Motzkin decomposable sets and functionsDEA congestion and returns to scale under an occurrence of multiple optimal projectionsClosed convex sets of Minkowski typeExistence of solutions of certain systems of nonlinear inequalitiesAdjustable Robust Optimization via Fourier–Motzkin EliminationA convergent splitting of matricesA subdifferential characterization of Motzkin decomposable functionsFourier-Motzkin elimination and its dualUnnamed ItemAnalyzing linear systems containing strict inequalities via evenly convex hullsZum heutigen Stand der nichtlinearen Optimierungstheorie







This page was built for publication: