Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5662630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multinomial Bayesian approach to the estimation of population and vocabulary size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Identifikation redundanter Nebenbedingungen in linearen Programmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561562 / rank
 
Normal rank

Revision as of 11:03, 18 June 2024

scientific article
Language Label Description Also known as
English
Hit-and-run algorithms for the identification of nonredundant linear inequalities
scientific article

    Statements

    Hit-and-run algorithms for the identification of nonredundant linear inequalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    hit-and-run algorithms
    0 references
    uniform interior points
    0 references
    probabilistic algorithms
    0 references
    eliminating redundant inequalites
    0 references
    system of linear inequalities
    0 references
    hypersphere directions algorithm
    0 references
    coordinate directions
    0 references
    Bayesian stopping rule
    0 references
    Computational experiences
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references