Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 41 (1988), S. 395-398 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 38 (1982), S. 1-24 
    ISSN: 1573-2878
    Keywords: Minimal representation ; systems of linear constraints ; linear inequalities ; linear equalities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A system of linear inequality and equality constraints determines a convex polyhedral set of feasible solutionsS. We consider the relation of all individual constraints toS, paying special attention to redundancy and implicit equalities. The main theorem derived here states that the total number of constraints together determiningS is minimal if and only if the system contains no redundant constraints and/or implicit equalities. It is shown that the existing theory on the representation of convex polyhedral sets is a special case of the theory developed here.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 61 (1989), S. 137-142 
    ISSN: 1573-2878
    Keywords: Convex polyhedral sets ; linear inequalities ; minimal representation ; prime representation ; redundancy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 23 (1979), S. 197-206 
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Bereits 1964 hat sichLlewellyn in seinem Buch „Linear Programming“ mit der Vereinfachung von linearen Programmen durch Ermittlung redundanter Nebenbedingungen beschäftigt. Der von ihm für seine Regeln erhobene Anspruch der Allgemeingültigkeit wird in diesem Beitrag durch Gegenbeispiele widerlegt. Ferner werden allgemeine Regeln zur Identifikation redundanter Nebenbedingungen hergeleitet und gezeigt, daß diese die Regeln vonLlewellyn, sofern man sie um eine zusätzliche Bedingung erweitert, umfassen.
    Notes: Abstract In his book “Linear Programming” [1964]Llewellyn devoted a chapter to simplifications and reductions of a linear programming problem by means of algebraic rules. These rules are claimed to be rather general. Here we give some counterexamples, where the rules ofLlewellyn do not hold. Furthermore we give some general rules to identify redundant constraints in the caseLlewellyn considers and show that the original rules ofLlewellyn together with an extra condition are a variant of these general rules. Finally we consider the question whether or not the rules ofLlewellyn should be used to identify redundant constraints.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 24 (1980), S. 203-210 
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...