Abstract
In this paper, we present a mathematical framework for the problem of minimization of the cash-out penalties of a natural gas shipper. The problem is modeled as a mixed-integer bilevel programming problem. To solve it efficiently, we re-formulate it as a standard mathematical programming problem making use of an exact penalty function approach, and describe a branch-and-bound algorithm for its solution.
Sign-in/Register to access full text options 
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.
