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

DOI10.1145/355900.355909zbMath0439.90083OpenAlexW1985710342MaRDI QIDQ3882208

No author found.

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

simplex methodcomputational resultsvariable eliminationmultiple objective optimizationpartitioning algorithmconstraint partitioninglinear goal programmingPAGPsequence of smaller subproblemsspecial termination rules

Mathematics Subject Classification ID

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

Related Items (9)

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

Uses Software

• PAGP

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