We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.

In this paper, new classes of generalized (F,α,ρ, d)-V -type I functions are introduced for differentiable multiobjective programming problems. Based upon these generalized convex functions, sufficient optimality conditions are established. Weak, strong and strict converse duality theorems are also derived for Wolfe and Mond-Weir type multiobjective dual programs.

The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed. Mathematics Subject Classification 2000: 90B10, 90C35, 90C27, 90C47.

A Multiobjective optimization approach is used to propose a set of digital controllers for the throttle control benchmark that fulfills its specifications and requirements. The Multiobjective approach allows us to determine the best set of solutions that characterizes the Pareto set, where each solution has a different trade-off between the design objectives.

The multiobjective optimization provides an extraordinary opportunity for the finest design of electronic circuits because it allows to mathematically balance contradictory requirements together with possible constraints. In this paper, an original and substantial improvement of an existing method for the multiobjective optimization known as GAM (Goal Attainment Method) is suggested. In our pro...

The multiobjective shortest path problem arises in many transportation and logistics applications, either as a stand-alone network routing problem or a subroutine of a more complex multiobjective network optimization problem. It has been addressed by different solution strategies, including labeling methods, ranking methods, constraint methods, and parametric methods. Increasing attention has b...

In this paper, we will present a multitude of global semiparametric sufficient efficiency conditions under various generalized ( ,b,φ,ρ,θ)-univexity hypotheses for the following multiobjective fractional subset programming problem: (P) Minimize(F1(S)/G1(S),F2(S)/G2(S), . . . ,Fp(S)/Gp(S)) subject to Hj(S) 0, j ∈ q, S∈An, where An is the n-fold product of the σ-algebra A of subsets of a given se...

A large number of techniques, such a neural networks and neurofuzzy systems, are used to produce empirical models based in part or in whole on observed data. A key stage in the modelling process is the selection of features. Irrelevant or noisy features increase the complexity of the modelling problem, may introduce additional costs in gathering unneeded data, and frequently degrade modelling p...