PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

DOI10.1145/355900.355909MaRDI QIDQ3882208zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355900.355909

zbMATH Keywords

computational resultsconstraint partitioninglinear goal programmingmultiple objective optimizationPAGPpartitioning algorithmsequence of smaller subproblemssimplex methodspecial termination rulesvariable elimination

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Cited in

(9)

• A surrogate for linear programs with random requirements
• A nonlinear mixed integer goal programming model for the two-machine closed flow shop
• Multiobjective water resources investment planning under budgetary uncertainty and fuzzy environment
• Nonlinear goal programming theory and practice: A survey
• A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems
• Internet based service networks
• Goal Programming Methods and Applications: A Survey
• On the enumerative nature of Gomory's dual cutting plane method
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?

Describes a project that uses

Uses Software

• PAGP

This page was built for publication: PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

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