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

DOI10.1016/0305-0548(95)00011-AMaRDI QIDQ2563887zbMATH OpenOpenAlexFDO

Authors 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

generalized reduced gradientmodified pattern searchnonlinear goal programmingpartitioning gradient based algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 912671
• Implementation of successive linear programming algorithms for non-convex goal programming
• Nonlinear goal programming using multi-objective genetic algorithms
• Nonlinear integer goal programming
• Nonlinear goal programming theory and practice: A survey

Cites work

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

Cited in

(3)

• Implementation of successive linear programming algorithms for non-convex goal programming
• Nonlinear goal programming theory and practice: A survey
• Optimization of the norm of a vector-valued DC function and applications

Describes a project that uses

Uses Software

• PGB
• PAGP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563887)