In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

A collective choice problem essentially a bargaining problem without disagreement outcome is studied. An exteneded solution, which determines simultaneously a solution and a reference point, is characterized through a system of axioms. It is proved that the unique extended solution meeting Pareto-optimality, independence of irrelevant alternatives, symmetry, and scale invariance axioms maximize...

There are currently three different game strategies to solve multi-criteria design problems: 1) Cooperative Games (Pareto Front), 2) Competitive Games (Nash Game) and 3) Hierarchical Games (Stackelberg Game). Nowadays EAs and Pareto front concept are more and more in solving practical design problems in industry, but this process is time consuming. Here, deterministic optimization method and Pa...

Multicriteria decision support methods are common in engineering design. These methods typically rely on a summation of weighted attributes to accomplish trade-offs among competing objectives. It has long been known that a weighted sum, when used for multicriteria optimization, may fail to locate all points on a nonconvex Pareto frontier. More recent results from the optimization literature rel...

A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...

This study examines the behavior of simple n-person bargaining problems under pre-donations where the Kalai-Smorodinsky (KS) solution is operant. Pre-donations are a unilateral commitment to transfer a portion of one’s utility to someone else, and are used to distort the bargaining set and thereby influence the bargaining solution. In equilibrium, these pre-donations are Pareto-improving over t...

In the design of many mechanical systems, the human designer knows its topology and shape. The goal for computational design thus results in finding a parameter set that optimizes multiple design goals. This paper presents a novel optimization method for such parametric design, the process of which is based on the human design process, but the search algorithm of which is gradient-based for eff...

ion layers of the system Device-level Analysis Network-level Analysis Reliabilitymanagement Solution Device-level Design Network-level Design Statistical T-matrix models of variations Device-level Variation Analysis Pareto-Space Designs

In this paper nonlinear Lagrange dual for a nonlinear multi-objective programming problem is formulated and it is proved that pareto optimal solution of the primal multi-objective programming problem and optimal solution of its nonlinear Lagrange dual are equal. Mathematics Subject Classification: 90C26, 90C39, 90C46