Pages that link to "Item:Q3748076"
From MaRDI portal
The following pages link to Successive Linear Programming at Exxon (Q3748076):
Displaying 26 items.
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Pooling problems with polynomial-time algorithms (Q306403) (← links)
- Optimal crude oil procurement under fluctuating price in an oil refinery (Q319604) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
- Optimality tests for partitioning and sectional search algorithms (Q1178318) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- A simple SLP algorithm for solving a class of nonlinear programs (Q1278946) (← links)
- A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries (Q1600859) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Modeling learning effects via successive linear programming (Q1824564) (← links)
- Cascading-heuristics for the solution of staircase linear programs (Q1891238) (← links)
- Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization (Q2182860) (← links)
- Feasibility and cost minimisation for a lithium extraction problem (Q2289901) (← links)
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks (Q2331358) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
- Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
- A bilinear approach to the pooling problem† (Q4327911) (← links)
- An inexact first-order method for constrained nonlinear optimization (Q5038172) (← links)
- Strong Convex Nonlinear Relaxations of the Pooling Problem (Q5114398) (← links)
- The computational complexity of the pooling problem (Q5964238) (← links)
- On the effectiveness of sequential linear programming for the pooling problem (Q6103203) (← links)
