In this paper, an effective computational algorithm is proposed for a class of linear multiplicative problem (P), which have broad applications in financial optimization, economic plan, engineering designs and stability analysis of nonlinear systems, and so on. By utilizing piecewise linearization technique underestimates the objective function, linear relaxation programming of the original lin...

The problem resulting from a goal programming problem with linear fractional criteria is not easy to solve due to the non-linear constraints inherent in its formulation. This paper introduces a simple and reliable test to establish whether a linear fractional goal programming problem has solutions that verify all goals and, if so, how to find them by solving a linear programming problem. This p...

A linearization technique is developed for multi-objective multi-quadratic 0-1 programming problems with linear and quadratic constraints to reduce it to multi-objective linear mixed 0-1 programming problems. The method proposed in this paper needs only O (kn) additional continuous variables where k is the number of quadratic constraints and n is the number of initial 0-1 variables.

The accurate discrimination of unexploded ordnance from geophysical signals is very difficult. Research has demonstrated that using a machine learning technique known as linear genetic programming in concert with human expertise can extend the accuracy of unexploded ordnance discrimination past currently published results. This paper describes how linear genetic programming offers the promise o...

Several algorithms have been developed to solve the two-level linear programming problem during the past years. In this paper, we will formulate the mixed integer two-level linear programming problem and develop both the exact and heuristic solution procedures based on the branch-and-Lund technique for solving the problem. Computational experience and comparisons will be presented.