A global optimization method for nonconvex separable programming problems

DOI10.1016/S0377-2217(98)00243-4zbMath0998.90063MaRDI QIDQ1847169

Chian-Son Yu, Han-Lin Li

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

goal programmingseparable programmingpiecewise linear function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Boolean programming (90C09)

Related Items (9)

A fuzzy ranking method with range reduction techniques ⋮ 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 ⋮ Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation ⋮ Optimizing invasive species management: a mixed-integer linear programming approach ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ On the posynomial fractional programming problems ⋮ A stochastic aggregate production planning model in a green supply chain: considering flexible lead times, nonlinear purchase and shortage cost functions

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inventory models with general backorder costs
• An approximate approach of global optimization for polynomial programming problems
• Discharge allocation for hydro-electric generating stations
• An efficient method for solving linear goal programming problems
• Two-Segment Separable Programming
• A Deterministic Inventory System with an Inventory-Level-Dependent Demand Rate

This page was built for publication: A global optimization method for nonconvex separable programming problems