The linear programming approach to the absolute value problem is to transform the unrestricted variable by the difference of two nonnegative variables. This transformation creates an unbounded feasible region which may lead to erroneous solution. To avoid this, Kaplan [Kaplan, Seymour. 1971....

The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The...

Uncertainty presents unique difficulties in multiobjective optimization problems, because decision makers are faced with risky situations requiring analysis of multiple outcomes in differing states of nature. Very few direct choice (interactive) multiobjective methods are capable of addressing...

An efficient algorithm for solving linear goal programming problems using partitioning and elimination procedures is presented. The algorithm takes advantage of the definition of ordinal preemptive factors in the objective function inherent in most goal programming formulations. Preliminary...