The article consists of two parts dealing with 2 and 3 objectives respectively, one being non-linear of ``bottleneck'' type, and the rest being linear ones. Definitions of efficient and extreme efficient solutions are introduced and a separate solution algorithms for these models are described. The correctness theorems for the algorithms are proved. Examples solved by the computer programs implementing the algorithms are included.

A. Tkachenko, A. Alhazov,

State University of Moldova

60 Mateevici Str.

Chisinau, Moldova MD-2009

E-mail:

State University of Moldova

60 Mateevici Str.

Chisinau, Moldova MD-2009

E-mail:

- Algorithms for minimum flows
- A sensitivity measure of the Pareto set in a vector l
_{infnity}-extreme combinatorial problem - Extremal gaps in BP
_{3}-designs **The Multiobjective Bottleneck Transportation Problem**- Genetic algorithms for the synthesis optimization of a set of irredundant diagnostic tests in the intelligent system
- T-invariants for jumping Petri nets
- Non-commutative computer algebra and molecular computing
- Ekaterina Logvinovna Yushchenko (a tribute in her memory)