Approximate saddle-point theorems in vector optimization

The paper contains definitions of different types of nondominated approximate solutions to vector optimization problems and gives some of their elementary properties. Then, saddle-point theorems corresponding to these solutions are presented with an application relative to approximate primal-dual pairs of solutions.This research was carried out while the author was working at the Bureau for Systems Analysis, State Office for Technical Development, Budapest, Hungary. The author is indebted to the referees for their useful comments.