Posterior Constraint Selection for Nonnegative Linear Programming

HTML  XML Download Download as PDF (Size: 405KB)  PP. 26-40  
DOI: 10.4236/ajor.2017.71002    1,507 Downloads   2,770 Views  Citations

ABSTRACT

Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.

Share and Cite:

Corley, H. , Noroziroshan, A. and Rosenberger, J. (2017) Posterior Constraint Selection for Nonnegative Linear Programming. American Journal of Operations Research, 7, 26-40. doi: 10.4236/ajor.2017.71002.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.