A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming

A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming

We consider a branch-and-reduce approach for solving generalized linear multiplicative programming. First, a new lower approximate linearization method is proposed; then, by using this linearization method, the initial nonconvex problem is reduced to a sequence of linear programming problems. Some t...

Full description

Bibliographic Details
Main Authors: Chun-Feng Wang, San-Yang Liu, Geng-Zhong Zheng
Format: Article
Language:English
Published: Hindawi Limited 2011-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2011/409491

Similar Items

Similar Items