Solving a Global-Mixed Integer Signomial Geometric Fractional Programming Problem

This article addresses mixed integer fractional signomial geometric programming (MIFSGP) problems, which have been widely used in industrial design. In this paper, first, we convert fractional signomial programming into a nonfractional problem so that it maintains its geometric structure. Then, conv...

Celý popis

Podrobná bibliografia

Vydané v:	Neutrosophic sets and systems Ročník 81; s. 655 - 666
Hlavní autori:	Nejad, J. Shirin, Saraj, M
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Neutrosophic Sets and Systems 01.07.2025 University of New Mexico
Predmet:	Algorithms fractional programming geometric programming Industrial design mixed integer programming non-convex functions spatial branch and bound algorithm
ISSN:	2331-6055, 2331-608X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!