The lexicographic duality for improper problems in linear and quadratic programming

This paper deals with lexicographic duality in linear and quadratic programming. The problem is so considered as how to formulate the primary lexicographic program to obtain the dual program which would permit lexicographic interpretation. Moreover, these programs must be connected by substantial mathematical relationships. In the paper this problem is solved for linear and quadratic programs.