The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general ...

Information about the weights is assumed to be in the form of arbitrary linear constraints. Conditions for checking dominance and potential optimality of decision alternatives are presented. In the ...