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....

We consider a single-product periodic-review inventory system for a retailer who has adopted a dual sourcing strategy to cope with potential supply process interruptions. Orders are placed to a perfectly reliable supplier and/or to a less reliable supplier that offers a better price. The success...

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...