PAGP
PAGP, a partitioning algorithm for (linear) goal programming problems
(Source: http://dl.acm.org/)
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
Sorted by year (- Zanette, Arrigo; Fischetti, Matteo; Balas, Egon: Lexicography and degeneracy: Can a pure cutting plane algorithm work? (2011)
- Balas, Egon; Fischetti, Matteo; Zanette, Arrigo: On the enumerative nature of Gomory’s dual cutting plane method (2010)
- Kasana, H.S.; Kumar, K.D.: Grouping algorithm for linear goal programming problems (2003)
- Saber, Hussein M.; Ravindran, A.: A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems (1996)
- Sutardi; Bector, C.R.; Goulter, Ian: Multiobjective water resources investment planning under budgetary uncertainty and fuzzy environment (1995)
- Saber, Hussein M.; Ravindran, A.: Nonlinear goal programming theory and practice: A survey (1993)
- Lashine, Sherif; Foote, B.; Ravindran, A.: A nonlinear mixed integer goal programming model for the two-machine closed flow shop (1991)
- Grove, M.A.: A surrogate for linear programs with random requirements (1988)
- Arthur, Jeffrey L.; Ravindran, A.: PAGP, a partitioning algorithm for (linear) goal programming problems (1980)