Successive Linear Programming at Exxon
From MaRDI portal
Publication:3748076
Recommendations
- Successive linear programming for ratio goal problems
- scientific article; zbMATH DE number 1786124
- An Improved Successive Linear Programming Algorithm
- scientific article; zbMATH DE number 912678
- Commentary—Progress in Linear Programming
- scientific article; zbMATH DE number 4055370
- scientific article; zbMATH DE number 1260455
- scientific article; zbMATH DE number 5809298
- Linear programming
Cited in
(27)- A new Lagrangean approach to the pooling problem
- Optimality tests for partitioning and sectional search algorithms
- Successive linearization methods for large-scale nonlinear programming problems
- A simple SLP algorithm for solving a class of nonlinear programs
- A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries
- Complexity analysis and algorithm design of pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Modeling learning effects via successive linear programming
- Cascading-heuristics for the solution of staircase linear programs
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
- Feasibility and cost minimisation for a lithium extraction problem
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
- Strong formulations for the pooling problem
- A decomposition-based heuristic for collaborative scheduling in a network of open-pit mines
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- Pooling problems with polynomial-time algorithms
- Optimal crude oil procurement under fluctuating price in an oil refinery
- Analysis of MILP techniques for the pooling problem
- A bilinear approach to the pooling problem†
- A cost minimization heuristic for the pooling problem
- An inexact first-order method for constrained nonlinear optimization
- Strong convex nonlinear relaxations of the pooling problem
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- The computational complexity of the pooling problem
- On the effectiveness of sequential linear programming for the pooling problem
- A new model and algorithm design of pooling problem
This page was built for publication: Successive Linear Programming at Exxon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748076)