A global optimization method for nonconvex separable programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1292040
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Convex Programming Methods for Global Optimization
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- Successive approximation in separable programming: An improved procedure for convex separable programs
Cites work
- A Deterministic Inventory System with an Inventory-Level-Dependent Demand Rate
- An approximate approach of global optimization for polynomial programming problems
- An efficient method for solving linear goal programming problems
- Discharge allocation for hydro-electric generating stations
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 412110 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- Inventory models with general backorder costs
- Two-Segment Separable Programming
Cited in
(28)- Inverse optimization for linearly constrained convex separable programming problems
- On nonconvex optimization problems with separated nonconvex variables
- The search for a global minimum in problems of nonconvex programming with dependences that are biseparable superpositions of convex functions
- Optimizing invasive species management: a mixed-integer linear programming approach
- On the posynomial fractional programming problems
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A heuristical solution method to separable nonlinear programming problems
- A stochastic aggregate production planning model in a green supply chain: considering flexible lead times, nonlinear purchase and shortage cost functions
- Global optimization of nonconvex problems with multilinear intermediates
- A fuzzy ranking method with range reduction techniques
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- On a decomposition method for nonconvex global optimization
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- Parametric approach to a class of nonconvex global optimization problems
- scientific article; zbMATH DE number 169245 (Why is no real title available?)
- scientific article; zbMATH DE number 1292040 (Why is no real title available?)
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- scientific article; zbMATH DE number 1054667 (Why is no real title available?)
- scientific article; zbMATH DE number 1795203 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- scientific article; zbMATH DE number 5583854 (Why is no real title available?)
- A new “Optimization‐Preserving‐Operator” applied to global optimization
- Global optimization of nonconvex factorable programming problems
- Pump scheduling optimization in water distribution system based on mixed integer linear programming
- Global multi-parametric optimal value bounds and solution estimates for separable parametric programs
- An optimization approach for supply chain management models with quantity discount policy
- On the single item multi-supplier system with variable lead-time, price-quantity discount, and resource constraints
This page was built for publication: A global optimization method for nonconvex separable programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847169)
