scientific article; zbMATH DE number 3121283

Cited in

(29)

Constrained nonsmooth utility maximization without quadratic inf convolution
Greedy packing and series-parallel graphs
Partitioning procedures for solving mixed-variables programming problems
A stable theorem of the alternative: An extension of the Gordan theorem
Seven fingers allow force-torque closure grasps on any convex polyhedron
Integer programming formulation of combinatorial optimization problems
Efficient enumeration of the vertices of polyhedra associated with network LP's
On \({\mathbb{K}}^{\Delta}\)
Comment on the theorems of Farkas and Haar
Simple games and magic squares
Measuring the smoothness of the DEA frontier
Sufficient matrices belong to \(L\).
On admissible communalities in factor analysis
Complementary pivot theory of mathematical programming
Boundedness relations for linear constraint sets
On the empirical status of axioms in theories of fundamental measurement
On the primal and dual constraint sets in geometric programming
Existence theory for the complex linear complementarity problem
Differential properties of the minimum function for diagonalizable quadratic problems
A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
On stationary equilibria of a single-controller stochastic game
Extreme varieties, concave functions, and the fixed charge problem
A generalization of the Frank—Wolfe theorem
Convex infinite horizon programs
The Diophantine Problem for Addition and Divisibility
On comparison of different sets of units used for improving the frontier in DEA models
On rational betting systems
Some characterizations of convex polyhedra
A geometric property of the least squares solution of linear equations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236241)