Staircase transportation problems with superadditive rewards and cumulative capacities

DOI10.1007/BF01585166zbMath0799.90091OpenAlexW2061089138MaRDI QIDQ1321671

Arthur F. jun. Veinott, Alan J. Hoffman

Publication date: 27 November 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585166

zbMATH Keywords

sublatticeassignmentbivariate distributionsage-dependent rewardscumulative-capacitated transportationdemand nodesoptimal salesstaircase disjoint union of rectanglessupply nodes

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Perspectives of Monge properties in optimization, Staircase transportation problems with superadditive rewards and cumulative capacities

Cites Work

• Unnamed Item
• Representation of general and polyhedral subsemilattices and sublattices of product spaces
• The structure of sublattices of the product of n lattices
• Bivariate distributions with given marginals
• Staircase transportation problems with superadditive rewards and cumulative capacities
• The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
• On Transportation Problems with Upper Bounds on Leading Rectangles
• An Inequality for Rearrangements