scientific article; zbMATH DE number 3078984
From MaRDI portal
Publication:5817857
zbMath0050.14201MaRDI QIDQ5817857
Robert M. Thrall, Howard Raiffa, Gerald L. Thompson, Theodore S. Motzkin
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (93)
Finiteness of relative equilibria of the four-body problem ⋮ Statistical decision analysis of stochastic linear programming problems ⋮ Efficient constraint/generator removal from double description of polyhedra ⋮ On the efficiency of convex polyhedra ⋮ Efficient solution generation for multiple objective linear programming based on extreme ray generation method ⋮ Geometry of possibility measures on finite sets ⋮ Enumeration of Nash equilibria for two-player games ⋮ The Expressive Power of Binary Submodular Functions ⋮ Complete linear descriptions of small asymmetric traveling salesman polytopes ⋮ How good are convex hull algorithms? ⋮ Some ways to reduce the space dimension in polyhedra computations ⋮ Constrained random matching ⋮ Segments in enumerating faces ⋮ How to find the convex hull of all integer points in a polyhedron? ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Numerical solution of special matrix games ⋮ On the occurrence probability of local binary patterns: a theoretical study ⋮ Volume‐based ranking method for a ranked voting system ⋮ A directed persistent homology theory for dissimilarity functions ⋮ Saddle points and scalarizing sets in multiple objective linear programming ⋮ Arbitrage-Free Neural-SDE Market Models ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Efficient Elimination of Redundancies in Polyhedra by Raytracing ⋮ The word problem in free normal valued lattice-ordered groups: A solution and practical shortcuts ⋮ Computing the vertices of tropical polyhedra using directed hypergraphs ⋮ Computing Shintani domains ⋮ PANDA: a software for polyhedral transformations ⋮ A tree traversal algorithm for decision problems in knot theory and 3-manifold topology ⋮ Increasing interdependence of multivariate distributions ⋮ a-tint: a polymake extension for algorithmic tropical intersection theory ⋮ A General Method for Deriving Tight Symbolic Bounds on Causal Effects ⋮ Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ The two variable per inequality abstract domain ⋮ Zero polyhedral cones ⋮ An algorithm to find the lineality space of the positive hull of a set of vectors ⋮ Generalizing the Template Polyhedral Domain ⋮ Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas ⋮ Traversing combinatorial 0/1-polytopes via optimization ⋮ Quantum violation of the suppes-zanotti inequalities and ``contextuality ⋮ Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums ⋮ Computing extreme rays of the metric cone for seven points ⋮ On the Geometry of Predictive Control with Nonlinear Constraints ⋮ A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra ⋮ Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. ⋮ The expressive power of binary submodular functions ⋮ Optimizing the double description method for normal surface enumeration ⋮ Bell-type inequalities for quasi-copulas ⋮ A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron ⋮ Incremental convex hull algorithms are not output sensitive ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ A method of transferring polyhedron between the intersection-form and the sum-form ⋮ On the convex hull of projective planes ⋮ Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball ⋮ A counterexample to Greenberg's algorithm for solving linear inequalities ⋮ An algorithm for determining all extreme points of a convex polytope ⋮ Model predictive control for perturbed max-plus-linear systems ⋮ Multiparametric linear programming with applications to control ⋮ Revisiting polyhedral analysis for hybrid systems ⋮ Double description method revisited ⋮ Some applications of combinatorial optimization in parallel computing ⋮ Prospective control in an enhanced manpower planning model ⋮ Finiteness of stationary configurations of the four-vortex problem ⋮ Predictive control for hybrid systems. Implications of polyhedral pre-computations ⋮ The generalized linear complementarity problem and an algorithm to find all its solutions ⋮ New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems ⋮ The polytope of optimal approximate designs: extending the selection of informative experiments ⋮ Global and preference-based optimization with mixed variables using piecewise affine surrogates ⋮ Eliminating extraneous edges in Greenberg's algorithm ⋮ Finding all vertices of a convex polyhedron ⋮ Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems ⋮ Combinatorial optimization and small polytopes ⋮ Generating all vertices of a polyhedron is hard ⋮ Least distance methods for the scheme of polytopes ⋮ A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities ⋮ Converting between quadrilateral and standard solution sets in normal surface theory ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Two variations of graph test in double description method ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ A sweep-plane algorithm for generating random tuples in simple polytopes ⋮ Motivation for working in numerical analysis ⋮ An algorithm for determining redundant inequalities and all solutions to convex polyhedra ⋮ Linearly constrained global optimization: a general solution algorithm with applications. ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees ⋮ Efficient enumeration of the vertices of polyhedra associated with network LP's ⋮ Obtaining simultaneous solutions of linear subsystems of inequalities and duals ⋮ Enumerating extreme points of a highly degenerate polytope ⋮ The Rankability of Data ⋮ Estimating the number of vertices of a polyhedron ⋮ Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization ⋮ Fast method for verifying Chernikov rules in Fourier-Motzkin elimination
This page was built for publication:
