Mathematical programming models for nutrition planning in developing nations typically involve the optimization of a single criterion function subject to resource and nutritional constraints. The nutritional constraints specify that the amount available of each nutrient for human consumption...

Recently Kornbluth and Steuer have developed a simplex-based algorithm for finding all weakly-efficient vertices of an augmented feasible region of a multiple objective linear fractional programming problem. As part of this algorithm, they presented a method for detecting certain...

This article presents a branch-and-reduce algorithm for globally solving for the first time a convex minimization problem (P) with p[greater-or-equal, slanted]1 additional multiplicative constraints. In each of these p additional constraints, the product of two convex functions is constrained to...

In this paper we study the multiple objective linear programming problem with parametric criteria coefficients. This problem is of interest since in many situations the coefficients of the objective functions of a multiple objective linear program either represent estimates of the true data or...