Article ID: | iaor20097485 |
Country: | Japan |
Volume: | 51 |
Issue: | 4 |
Start Page Number: | 265 |
End Page Number: | 273 |
Publication Date: | Dec 2008 |
Journal: | Journal of the Operations Research Society of Japan |
Authors: | Murota Kazuo, Shioura Akiyoshi |
Keywords: | networks: flow, programming: convex, programming: network, programming: nonlinear, combinatorial optimization |
M–convex and L–convex functions in continuous variables constitute subclasses of convex functions with nice combinatorial properties. In this note we give proofs of the fundamental facts that closed proper M–convex and L–convex functions are continuous on their effective domains.