Linear Inequalities and Related Systems. (AM-38)
From MaRDI portal
Publication:3236238
Cited in
(92)- Ambiguity through confidence functions
- The Gröbner fan of an ideal
- Subspaces with well-scaled frames
- Perturbation theory of completely mixed bimatrix games
- Minimal representation of convex polyhedral sets
- Some aspects of the development of linear algebra in the last sixty years
- Optimal strategic planning problems in manufacturing based on the input- output models
- 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
- On stochastic programming. I: Static linear programming under risk
- Termination of reactions in chemical systems specified by mass-balance reaction formulas
- Consistency, redundancy, and implied equalities in linear systems
- Perturbed cones for analysis of uncertain multi-criteria optimization problems
- An extension of a theorem of Jeroslow and Kortanek
- Line configuration to minimize setup costs
- A necessary and sufficient condition for the positivity of the growth rate in the Neumann-Gale model of economic growth
- 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
- Exploiting complete linear descriptions for decentralized power market problems with integralities
- Von Neumann-Gale dynamics and capital growth in financial markets with frictions
- On the sensitivity of the optimal partition for parametric second-order conic optimization
- Preferences with grades of indecisiveness
- Allocating multiple defensive resources in a zero-sum game setting
- Measurement structures and linear inequalities
- On finite linear systems containing strict inequalities
- Unimodular modules
- On the limit perfect public equilibrium payoff set in repeated and stochastic games
- Linear programming in complex space
- Notes on linear inequalities. I: The intersection of the non-negative orthant with complementary orthogonal subspaces
- 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
- Complete linear proofs of systems of linear inequalities
- Some properties of tensor products of matrices
- On the modularity of a matrix
- A note on duality gaps in linear programming over convex sets
- The generalized assignment problem with minimum quantities
- Maßtheoretische Marginalprobleme
- An exposition of the (linear) complementarity problem
- John von Neumann’s work in the theory of games and mathematical economics
- Ein lineares Programmierungsverfahren
- Interior Point Methods for Nonlinear Optimization
- Fast computation of the leastcore and prenucleolus of cooperative games
- A fast ellipsoidal MPC scheme for discrete-time polytopic linear parameter varying systems
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Method of chebyshev centers for solving the problem of equilibrium having singularities
- Polyhedral polarity defined by a general bilinear inequality
- On linear programming duality and Landau's characterization of tournament
- Three-valued representative systems
- DEA-type models for designing optimal systems and determining optimal budgets
- Some theoretical implications of local optimization
- Some variations, extensions, and generalizations of Tucker’s theorems
- Consumption and Portfolio Policies With Incomplete Markets and Short‐Sale Constraints: the Finite‐Dimensional Case1
- Some bifurcation problems of stability
- Conic convex programming and self-dual embedding
- Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programming problems
- IFORS' Operational Research Hall of Fame Harold W. Kuhn
- Typical properties of optimal growth in the von Neumann expanding model for large random economies
- Refining the partition for multifold conic optimization problems
- Von Neumann's expanding model on random graphs
- Local, dimensional and universal rigidities: a unified Gram matrix approach
- A Note on First-Order Sufficient Optimality Conditions for Pareto Problems
- Partial probabilistic information
- What the transportation problem did for me
- Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben
- On the intersections of cones and subspaces
- On a generalization of theFarkas theorem
- A branch‐bound algorithm for the capacitated facilities location problem
- scientific article; zbMATH DE number 3393931 (Why is no real title available?)
- Approximation by Step Functions
- The complexity of linear programming
- Systems of representatives
- Singular integrals with flag kernels and analysis on quadratic CR manifolds
- Optimal partition invariancy in multi-parametric linear optimization
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
- Persistence and extinction in the anti-symmetric Lotka-Volterra systems
- Lagrangian duality in convex conic programming with simple proofs
- To be fair: claims have amounts and strengths
- Asset pricing and hedging in financial markets with fixed and proportional transaction costs
- CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
- Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
- Minimizing the number of tardy jobs with uniform processing times on parallel machines
- Lineare Programme und allgemeine Vertretersysteme
- Gale diagrams of convex polytopes and positive spanning sets of vectors
- Active constraint set invariancy sensitivity analysis in linear optimization
- Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems
This page was built for publication: Linear Inequalities and Related Systems. (AM-38)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236238)
