Supermodular function: Difference between revisions

Content deleted Content added
Added short description of a supermodular function, redefined supermodular functions in terms of lattices, changed section about submodular functions of subsets to be about supermodular set functions
Citation bot (talk | contribs)
Altered doi. Added series. Removed parameters. | Use this bot. Report bugs. | Suggested by Jay8g | Category:CS1 errors: DOI | #UCB_Category 1/3
Line 39:
 
=== Definition ===
Let <math>S</math> be a finite set. A set function <math>f: 2^S \to \mathbb{R}</math> is '''supermodular''' if it satifies the following (equivalent) conditions<ref>{{Citation |last=McCormick |first=S. Thomas |title=Submodular Function Minimization |date=2005 |workseries=Handbooks in Operations Research and Management Science |volume=12 |pages=321–391 |url=https://linkinghub.elsevier.com/retrieve/pii/S0927050705120076 |access-date=2024-12-12 |publisher=Elsevier |language=en |doi=10.1016/s0927-0507(05)12007-6. |isbn=978-0-444-51507-0}}</ref>:
 
# <math> f(A)+f(B) \leq f(A \cap B) + f(A \cup B) </math> for all <math> A, B \subseteq S </math>.