scientific article

Publication date: 1956

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

mathematical biology, insurance mathematics, operations research

Related Items

Optimality conditions in multiobjective differentiable programming, New superbridge index calculations from non-minimal realizations, The use of the optimal partition in a linear programming solution for postoptimal analysis, The practical behavior of the homogeneous self-dual formulations in interior point methods, A polynomial Newton method for linear programming, Some \(LP\) algorithms using orthogonal matrices, Finding a partial solution to a linear system of equations in positive integers, A generalized homogeneous and self-dual algorithm for linear programming, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix, A simplified homogeneous and self-dual linear programming algorithm and its implementation, Rigidity and polarity. II: Weaving lines and tensegrity frameworks, Consistency, redundancy, and implied equalities in linear systems, Partitioning procedures for solving mixed-variables programming problems, Existence of solutions of pseudo-concave inequalities, The equivalence of linear programs and zero-sum games, Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative, Computing the natural factors of a closed expanding economy model, Farkas' theorem under convex combination, Transitivity in the small and in the large for states-additive SSB utilities, Harsanyi's social aggregation theorem for state-contingent alternatives, Homogeneous programming and symmetrization, Note on a paper of Broyden, A discrete variant of Farkas' lemma, Lexicographic geometric programming, Tucker's theorem for almost skew-symmetric matrices and a proof of Farkas' lemma, A discrete variant of Farkas' lemma and related results, Interior Point Methods for Nonlinear Optimization, Über reguläre Kettengruppen, An easy way to teach interior-point methods., Description of the optimal solution set of the linear programming problem and the dimension formula, On the extension of additive utilities to infinite sets, Extreme varieties, concave functions, and the fixed charge problem, A saddlepoint theorem for self-dual linear systems, Termination of reactions in chemical systems specified by mass-balance reaction formulas, Unnamed Item, Bounded approximants to monotone operators on Banach spaces, Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces, New computations of the superbridge index, The Fritz John necessary optimality conditions in the presence of equality and inequality constraints, The Jacobian matrix and global univalence of mappings, Existence of solutions of certain systems of nonlinear inequalities, Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs), Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory, Some generalizations and applications of a comples transposition theorem, Theorems of the alternative for complex linear inequalities, Error bounds for nondegenerate monotone linear complementarity problems, On the key theorem of Tucker and Levison for complex linear inequalities, On duality for real and complex programming problems, Existence theory for the complex linear complementarity problem, Perron-Frobenius properties of \(Ax-\lambda Bx\), A dual-linear program, Unnamed Item, Characterization of local solutions for a class of nonconvex programs, On sum-symmetric matrices, Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games, George B. Dantzig: a legendary life in mathematical programming, Stable monotone variational inequalities, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben, On polyhedral extension of some LP theorems, The theory of linear programming:skew symmetric self-dual problems and the central path^*, Monotone Optimierungsaufgaben, On \(\ell_ p\) programming, Polyhedral extensions of some theorems of linear programming, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems, On the intersections of cones and subspaces