Abstract

The distribution of a limited rate of high-pressure gas to gas-lifted wells, while respecting injection bounds and activation precedence constraints, consists of a mixed-integer nonlinear programming problem. This paper proposes a mixed-integer linear formulation obtained by piecewise-linearizing the nonlinear functions, thereby allowing the use of integer programming algorithms. Valid inequalities for the convex hull of feasible solutions are derived from knapsack covers, for which exact and approximate lifting procedures yield stronger inequalities. Numerical results show that these cover-based cuts reduce the number of nodes explored in a branch-and-bound search.

Full Text
Paper version not known

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

Disclaimer: 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.