The purpose of this paper is to develop a useful technique for solving linear programmes involving more than one objective function. Motivation for solving multicriterion linear programmes is given ...

Learn about the input validation, linear search, count occurrences, find maximum and find minimum algorithms covered within Higher Computing Science.

We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...

Learn about the input validation, linear search, count occurrences, find maximum and find minimum algorithms covered within Higher Computing Science.

Shortest-paths problems are a special case of minimum-cost flow, so the new minimum-cost-flow algorithm could also be used to solve the negative-weight shortest-paths problem in near-linear time, ...