![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Sharing problems are minimax problems with separable objective, i.e. For quasiconvex and lower semicontinuous functions fj
on arbitrary totally ordered sets, we derive a duality theory.In particular, a general dual method is shown to apply to linear, combinatorial and convex sharing problems.For linear and bottleneck share functions fj
the method is polynomially bounded in many applications.
AMS 1980 Subject Classifications:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.