Geometric Programming with Discrete Variables Subject to Max-Product Fuzzy Relation Constraints

The problem of geometric programming subject to max-product fuzzy relation constraints with discrete variables is studied. The major difficulty in solving this problem comes from nonconvexity caused by these product terms in the general geometric function and the max-product relation constraints. We...

Full description

Saved in:
Bibliographic Details
Published in:Discrete dynamics in nature and society 2018-01, Vol.2018 (2018), p.1-8
Main Authors: Yang, Xiao-Peng, Fang, Shu-Cherng, Cao, Bing-Yuan, Qin, Zejian
Format: Article
Language:English
Subjects:
Economic models
Integer programming
Mathematical models
Mathematical programming
Mixed integer
Nonlinear programming
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of geometric programming subject to max-product fuzzy relation constraints with discrete variables is studied. The major difficulty in solving this problem comes from nonconvexity caused by these product terms in the general geometric function and the max-product relation constraints. We proposed a 0-1 mixed integer linear programming model and adopted the branch-and-bound scheme to solve the problem. Numerical experiments confirm that the proposed solution method is effective.
ISSN:1026-0226
1607-887X
DOI:10.1155/2018/1610349