A global optimization method for nonconvex separable programming problems
type: Item
instance of: scholarly article
title: A global optimization method for nonconvex separable programming problems
zbMATH Open document ID: 0998.90063
DOI: 10.1016/S0377-2217(98)00243-4
author: Han-Lin Li
author: Chian-Son Yu
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1829880
zbMATH Keywords: goal programming
zbMATH Keywords: piecewise linear function
zbMATH Keywords: separable programming
describes a project that uses: LINDO
MaRDI profile type: Publication
cites work: A Deterministic Inventory System with an Inventory-Level-Dependent Demand Rate
cites work: Q3134873
cites work: Inventory models with general backorder costs
cites work: Q5538306
cites work: Discharge allocation for hydro-electric generating stations
cites work: An efficient method for solving linear goal programming problems
cites work: An approximate approach of global optimization for polynomial programming problems
cites work: Two-Segment Separable Programming
cites work: Q3135820
description: scientific article; zbMATH DE number 1829880