Linear Inequalities and Related Systems. (AM-38)
From MaRDI portal
Publication:3236238
DOI10.1515/9781400881987zbMath0072.37502OpenAlexW2564170924MaRDI QIDQ3236238
No author found.
Publication date: 1956
Full work available at URL: https://doi.org/10.1515/9781400881987
Related Items (87)
Conic convex programming and self-dual embedding ⋮ Maßtheoretische Marginalprobleme ⋮ On a generalization of theFarkas theorem ⋮ A branch‐bound algorithm for the capacitated facilities location problem ⋮ A Note on First-Order Sufficient Optimality Conditions for Pareto Problems ⋮ Exploiting complete linear descriptions for decentralized power market problems with integralities ⋮ Measurement structures and linear inequalities ⋮ A fast ellipsoidal MPC scheme for discrete-time polytopic linear parameter varying systems ⋮ The Gröbner fan of an ideal ⋮ On finite linear systems containing strict inequalities ⋮ Subspaces with well-scaled frames ⋮ Perturbation theory of completely mixed bimatrix games ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Von Neumann-Gale dynamics and capital growth in financial markets with frictions ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ On linear programming duality and Landau's characterization of tournament ⋮ Line configuration to minimize setup costs ⋮ DEA-type models for designing optimal systems and determining optimal budgets ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ John von Neumann’s work in the theory of games and mathematical economics ⋮ Persistence and extinction in the anti-symmetric Lotka-Volterra systems ⋮ Lagrangian duality in convex conic programming with simple proofs ⋮ Unimodular modules ⋮ A necessary and sufficient condition for the positivity of the growth rate in the Neumann-Gale model of economic growth ⋮ Minimal representation of convex polyhedral sets ⋮ Some variations, extensions, and generalizations of Tucker’s theorems ⋮ Unnamed Item ⋮ On the limit perfect public equilibrium payoff set in repeated and stochastic games ⋮ Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case1 ⋮ Three-valued representative systems ⋮ Ein lineares Programmierungsverfahren ⋮ Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems ⋮ On the sensitivity of the optimal partition for parametric second-order conic optimization ⋮ Some aspects of the development of linear algebra in the last sixty years ⋮ Refining the partition for multifold conic optimization problems ⋮ Active constraint set invariancy sensitivity analysis in linear optimization ⋮ Some bifurcation problems of stability ⋮ Interior Point Methods for Nonlinear Optimization ⋮ Preferences with grades of indecisiveness ⋮ Some theoretical implications of local optimization ⋮ Partial probabilistic information ⋮ The complexity of linear programming ⋮ What the transportation problem did for me ⋮ Optimal strategic planning problems in manufacturing based on the input- output models ⋮ IFORS' Operational Research Hall of Fame Harold W. Kuhn ⋮ Singular integrals with flag kernels and analysis on quadratic CR manifolds ⋮ A saddlepoint theorem for self-dual linear systems ⋮ The roots of matrix pencils \((Ay=\lambda By)\): Existence, calculations, and relations to game theory ⋮ Tchebyscheff bounds for the space of agent characteristics ⋮ An exposition of the (linear) complementarity problem ⋮ Fast computation of the leastcore and prenucleolus of cooperative games ⋮ On stochastic programming. I: Static linear programming under risk ⋮ Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems ⋮ Termination of reactions in chemical systems specified by mass-balance reaction formulas ⋮ Unnamed Item ⋮ Linear programming in complex space ⋮ Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces ⋮ Approximation by Step Functions ⋮ Typical properties of optimal growth in the Von Neumann expanding model for large random economies ⋮ Systems of representatives ⋮ Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory ⋮ Extreme points of Leontief substitution systems ⋮ Theorems of the alternative for complex linear inequalities ⋮ On the key theorem of Tucker and Levison for complex linear inequalities ⋮ Theory of majority decision elements ⋮ Parametrized games and the eigenproblem ⋮ The geometry of solvability and duality in linear programming ⋮ Method of chebyshev centers for solving the problem of equilibrium having singularities ⋮ Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone ⋮ On a probabilistic approach to synthesize control policies from example datasets ⋮ Complete linear proofs of systems of linear inequalities ⋮ Perturbed cones for analysis of uncertain multi-criteria optimization problems ⋮ Some properties of tensor products of matrices ⋮ On the modularity of a matrix ⋮ Lineare Programme und allgemeine Vertretersysteme ⋮ Von Neumann’s expanding model on random graphs ⋮ A note on duality gaps in linear programming over convex sets ⋮ Ambiguity through confidence functions ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs ⋮ An extension of a theorem of Jeroslow and Kortanek ⋮ Polyhedral polarity defined by a general bilinear inequality ⋮ Gale diagrams of convex polytopes and positive spanning sets of vectors ⋮ Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach ⋮ Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben ⋮ Allocating multiple defensive resources in a zero-sum game setting ⋮ The generalized assignment problem with minimum quantities ⋮ On the intersections of cones and subspaces
This page was built for publication: Linear Inequalities and Related Systems. (AM-38)
