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