An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback