Comparative Statics with Concave and Supermodular Functions

Certain problems in comparative statics, including (but not exclusively) certain problems in consumer theory, cannot be easily addressed by the methods of lattice programming. One reason for this is that there is no order on the choice space which orders choices in a way which conforms with the comparison desired, and which also orders constraint sets in the strong set order it induces. The objective of this paper is to show how lattice progamming theory can be extended to deal with situations like these. We show that the interaction of concavity and supermodularity in objective or constraint functions yield a structure that is very useful for comparative statics.