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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
