Library

X
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
    Weakk-majorization and polyhedra (1998)
    Springer
    Mathematical programming 81 (1998), S. 37-53 
    Details
    ISSN: 1436-4646
    Keywords: Majorization ; Polyhedra
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For integersk andn withk ⩽ n a vectorx ∈ ℝ n is said to be weaklyk-majorized by a vectorq ∈ ℝ k if the sum of ther largest components ofx does not exceed the sum of ther largest components ofq, forr = 1,⋯,k. For a givenq the set of vectors weaklyk-majorized byq defines a polyhedronP(q; k). We determine the vertices of bothP(q; k) and its integer hullQ(q; k). Furthermore a complete and nonredundant linear description ofQ(q; k) is given. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584843
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...