Abstract
We consider the problem of when two variables in a linear programming model can be considered to be substitutes (self-interfering) or complements (self-reinforcing). Several definitions proposed in the economic and mathematical literature are investigated in the context of linear programming models. The concept of determinacy is used to formalize and classify these definitions. Determinacy is studied for a class of network flow models, where graph-theoretic characterizations of substitutes and complements are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
