Characterizing solutions of rough programming problems

In this paper we define a new kind of mathematical programming problems. This kind, in which the decision set is a rough set, is called a rough programming problem. A rough optimal solution and a rough saddle point will be characterized. Some illustrative examples are presented.