Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
From MaRDI portal
Publication:439361
DOI10.1016/j.ejor.2011.08.027zbMath1244.90263MaRDI QIDQ439361
Andrés Codas, Eduardo Camponogara
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.027
integer programming; piecewise linearization; lift-gas allocation; lifted cover cuts; routing constraints
Related Items
Scheduling pumpoff operations in onshore oilfields under electric-power constraints, Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing, Models and algorithms for optimal piecewise-linear function approximation, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
Cites Work
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
- Piecewise-linear approximations of multidimensional functions
- Models for representing piecewise linear cost functions
- Approximating separable nonlinear functions via mixed zero-one programs
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Solving a gas-lift optimization problem by dynamic programming
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Reformulation and Decomposition of Integer Programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Surrogate Constraints
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
