scientific article; zbMATH DE number 3022422
From MaRDI portal
Publication:5760872
zbMath0014.24601MaRDI QIDQ5760872
Publication date: 1936
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Motzkin decomposition of closed convex sets, Minimization of semicoercive functions: a generalization of Fichera's existence theorem for the Signorini problem, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, On Pólya frequency functions. I. The totally positive functions and their Laplace transforms, Uniqueness of integer solution of linear equations, Maximal Separation Theorems for Convex Sets, HySAT: An efficient proof engine for bounded model checking of hybrid systems, Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens, Combinatorics and Hodge theory, Combinatorial geometry takes the lead, Irreducibly inconsistent systems of linear inequalities, On the stability of the Motzkin representation of closed convex sets, Evenly convex sets, and evenly quasiconvex functions, revisited, Rigorous filtering using linear relaxations, A stable theorem of the alternative: An extension of the Gordan theorem, Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection, Motzkin predecomposable sets, A weak characterisation of the Delaunay triangulation, Spira's theorems on complete linear proofs of systems of linear inequalities, Proof synthesis and reflection for linear arithmetic, On OM-decomposable sets, A discrete variant of Farkas' lemma and related results, On comparison of different sets of units used for improving the frontier in DEA models, Description of the optimal solution set of the linear programming problem and the dimension formula, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, Linear quantifier elimination, Applications of symmetric derivatives in mathematical programming, On M-predecomposable sets, Multivalued convexity and optimization: A unified approach to inequality and equality constraints, A counterexample to Greenberg's algorithm for solving linear inequalities, On Motzkin decomposable sets and functions, DEA congestion and returns to scale under an occurrence of multiple optimal projections, Closed convex sets of Minkowski type, Existence of solutions of certain systems of nonlinear inequalities, Adjustable Robust Optimization via Fourier–Motzkin Elimination, A convergent splitting of matrices, A subdifferential characterization of Motzkin decomposable functions, Fourier-Motzkin elimination and its dual, Unnamed Item, Analyzing linear systems containing strict inequalities via evenly convex hulls, Zum heutigen Stand der nichtlinearen Optimierungstheorie
