Generalized convex programming

A method is proposed for solution of problems in convex programming which does not require completeness or monotoneity of binary relations and makes it possible for the concavity condition of the vector function to be replaced by a less restrictive condition that the functions and their relationships match.