logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems

delete1996-02-01
delete5
PRE
AI
S
Saber, HM *
A
A. Ravindran
DOI：10.1016/0305-0548(95)00011-Adelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper presents an efficient and reliable method called the partitioning gradient based (PGB) algorithm for solving nonlinear goal programming (NLGP) problems. The PGB algorithm uses the partitioning technique developed for linear GP problems and the generalized reduced gradient (GRG) method to solve nonlinear programming problems. The PGB algorithm is tested against the modified pattern search (MPS) method, currently available for solving NLGP problems. The results indicate that the PGB algorithm always outperforms the MPS method except for some small problems. In addition, the PGB method found the optimal solution for all test problems proving its robustness and reliability, while the MPS method failed in more than half of the test problems by converging to a nonoptimal point.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available