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

DOI10.1016/0305-0548(95)00011-AzbMath0868.90102OpenAlexW1982330984MaRDI QIDQ2563887

Yanyan Li

Publication date: 6 January 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00011-a

zbMATH Keywords

nonlinear goal programminggeneralized reduced gradientmodified pattern searchpartitioning gradient based algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (2)

Nonlinear goal programming theory and practice: A survey ⋮ Optimization of the norm of a vector-valued DC function and applications

Uses Software

• PAGP
• PGB

Cites Work

• A gradient algorithm for chance constrained nonlinear goal programming
• Nonlinear goal programming theory and practice: A survey
• PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming

This page was built for publication: A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems