Polyhedral sets having a least element

DOI10.1007/BF01584992zbMath0245.90015WikidataQ60018271 ScholiaQ60018271MaRDI QIDQ5657902

Arthur F. jun. Veinott, Richard W. Cottle

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (37)

On some classes of matrices related to solving linear complementarity problems as linear programs ⋮ New algorithms for generalized network flows ⋮ On perfect \(0,\pm 1\) matrices ⋮ The Linear Complementarity Problems with a Few Variables per Constraint ⋮ Least elements revisited ⋮ A linear programming primer: from Fourier to Karmarkar ⋮ T. Parthasarathy's contributions to complementarity problems: a survey ⋮ The linear complementarity problem with a parametric input ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ Minimality and complementarity properties associated with Z-functions and M-functions ⋮ Nonnegative generalized inverses and least elements of polyhedral sets ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ Matrices and the linear complementarity problem ⋮ An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix ⋮ A class of linear complementarity problems solvable in polynomial time ⋮ Complementary irreducibilityS– matrices with connections to solutions of the linear complementarity problem ⋮ A note on polyhedral sets having A least element ⋮ Disjunctive programming and the generalized Leontief input-output model ⋮ Linear complementarity problems solvable by A single linear program ⋮ Pricing of American options, using the Brennan-Schwartz algorithm based on finite elements ⋮ On hidden \(Z\)-matrix and interior point algorithm ⋮ Isotone solutions of parametric linear complementarity problems ⋮ On monotonicity in parametric linear complementarity problems ⋮ M-matrix characterizations. I: nonsingular M-matrices ⋮ Linear complementarity problems and characterizations of Minkowski matrices ⋮ On a class of least-element complementarity problems ⋮ Hidden Z-matrices with positive principal minors ⋮ Variational inequalities and the pricing of American options ⋮ On cone orderings and the linear complementarity problem ⋮ Unnamed Item ⋮ Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone ⋮ The generalized Leontief input-output model and its application to the choice of new technology ⋮ Interior-point algorithms for global optimization ⋮ Locating service centers with precedence constraints ⋮ New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ Analytical description of strong extremum in a convex set

Cites Work

• Unnamed Item
• Unnamed Item
• Extreme points of Leontief substitution systems
• Aufgaben monotoner Art
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Characterizations of Real Matrices of Monotone Kind
• A Partition Theorem for Euclidean n-Space
• The Unloading Problem for Plane Curves

This page was built for publication: Polyhedral sets having a least element