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

Zejian Qin, Bingyuan Cao, Shu-Cherng Fang and Xiao-Peng Yang

Discrete Dynamics in Nature and Society, 2018, vol. 2018, 1-8

Abstract:

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.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2018/1610349.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2018/1610349.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:1610349

DOI: 10.1155/2018/1610349

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().