A heuristic procedure for rounding posynomial geometric programming solutions to discrete values
- 30 September 1996
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 30 (4), 623-629
- https://doi.org/10.1016/0360-8352(95)00180-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Evaluation of optimization methods for machining economics modelsComputers & Operations Research, 1993
- Yet another geometric programming dual algorithmOperations Research Letters, 1983
- Optimal selection of machining rate variables by geometric programmingInternational Journal of Production Research, 1973
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- A Linear Programming Approach to the Chemical Equilibrium ProblemManagement Science, 1958