Polyhedral sets having a least element
From MaRDI portal
Publication:5657902
Cites work
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3238303 (Why is no real title available?)
- A Partition Theorem for Euclidean n-Space
- Aufgaben monotoner Art
- Characterizations of Real Matrices of Monotone Kind
- Extreme points of Leontief substitution systems
- Optimal Solution of a Dynamic Leontief Model with Substitution
- The Unloading Problem for Plane Curves
Cited in
(38)- Pricing of American options, using the Brennan-Schwartz algorithm based on finite elements
- On a class of least-element complementarity problems
- On perfect \(0,\pm 1\) matrices
- Nonnegative generalized inverses and least elements of polyhedral sets
- Perron-Frobenius, principal eigenvalue, maximum principle: a personal itinerary
- The Linear Complementarity Problems with a Few Variables per Constraint
- Linear complementarity problems solvable by A single linear program
- Variational inequalities and the pricing of American options
- Analytical description of strong extremum in a convex set
- A note on polyhedral sets having A least element
- Isotone solutions of parametric linear complementarity problems
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- On cone orderings and the linear complementarity problem
- A linear programming primer: from Fourier to Karmarkar
- T. Parthasarathy's contributions to complementarity problems: a survey
- The generalized Leontief input-output model and its application to the choice of new technology
- Hidden Z-matrices with positive principal minors
- An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix
- Linear complementarity problems and characterizations of Minkowski matrices
- M-matrix characterizations. I: nonsingular M-matrices
- The linear complementarity problem with a parametric input
- Least elements revisited
- Interior-point algorithms for global optimization
- Sensitivity analysis for the stationary distribution of reflected Brownian motion in a convex polyhedral cone
- A class of linear complementarity problems solvable in polynomial time
- Matrices and the linear complementarity problem
- Locating service centers with precedence constraints
- Projection methods for finding the greatest element of the intersection of max-closed convex sets
- Minimality and complementarity properties associated with Z-functions and M-functions
- Disjunctive programming and the generalized Leontief input-output model
- On some classes of matrices related to solving linear complementarity problems as linear programs
- On hidden \(Z\)-matrix and interior point algorithm
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Complementary irreducibilityS– matrices with connections to solutions of the linear complementarity problem
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- New algorithms for generalized network flows
- On monotonicity in parametric linear complementarity problems
This page was built for publication: Polyhedral sets having a least element
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657902)
