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 ...
As applied to mixed-integer programming, Benders' original work made two primary contributions: (1) development of a "pure integer" problem (Problem P) that is equivalent to the original mixed-integer ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback