Mathematical Methods of Operations Research

Best, M.; Ritter, K.

doi: 10.1007/BF01920297pmid: N/A

By using conjugate directions a method for solving convex quadratic programming problems is developed. The algorithm generates a sequence of feasible solutions and terminates after a finite number of iterations. Extensions of the algorithm for nonconvex and large structured quadratic programming problems are discussed.

Derigs, U.

doi: 10.1007/BF01920298pmid: N/A

Cuninghame-Green, R.; Harries, G.

doi: 10.1007/BF01920299pmid: N/A

A policy for allocating each demand for an emergency service, arising within a region, to a currently available one of a set of service units, so as to minimise overall average response time, results in a straightforward generalisation of the elementary nearest-neighbour rule.

Chandra, S.; Mond, B.; Durga Prasad, M.

doi: 10.1007/BF01920300pmid: N/A

A certain constrained ratio game is shown to be equivalent to a pair of mutually dual generalized fractional programming problems. This also extends the concept of symmetric duality to min-max fractional programming.

Szwarc, W.

doi: 10.1007/BF01920301pmid: N/A

This paper considers a generalization of the classical flow shop problem wheren the items, grouped intok fixed sequences (clusters) are processed onm machines. A permutation is being sought that minimizes the completion time of processing all items. This paper develops conditions when the clustered problem can be reduced to a classical case. It also provides sufficient optimality conditions for an approximate solution generated by a method for the two machine clustered problem.

Kohaupt, L.

doi: 10.1007/BF01920302pmid: N/A

The rapidly decreasing mineral resources make the manufacturers of automobiles to construct engines with as low consumption as possible.

Pallaschke, D.; Mahjoub, Ali; Faigle, U.; Rociński, A.; Crouzeix, J.

doi: 10.1007/BF01920303pmid: N/A

Donner, K.; Radermacher, F.

doi: 10.1007/BF01920304pmid: N/A

doi: 10.1007/BF01920305pmid: N/A