We propose a new solution to the problem of positioning base station transmitters of a mobile phone network and assigning frequencies to the transmitters, both in an optimal way. Since an exact solution cannot be expected to run in polynomial time for all interesting versions of this problem (they are all NP-hard), our algorithm follows a heuristic approach based on the evolutionary paradigm. F...

In this paper the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality cond...

In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...

  We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...

In this paper, a novel multiobjective evolutionary algorithm for optimal reactive power (VAR) dispatch problem is presented. The optimal VAR dispatch problem is formulated as a nonlinear constrained multiobjective optimization problem where the real power loss and the bus voltage deviations are to be minimized simultaneously. A new Strength Pareto Evolutionary Algorithm (SPEA) based approach is...

Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. In addition to their multi-criteria nature, the different problems included in this field inherit the precedence ...