A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...
A new efficient system of representing the decision-maker's preference structure in solving multicriteria integer programming problems is developed. The problem is solved by an interactive ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback