Chung, S.-J., H.W. Hamacher, F. Maffioli and K.G. Murty, Note on combinatorial optimization with max-linear objective functions, Discrete Applied Mathematics 42 (1993) 139-145. We consider combinatorial optimization problems with a feasible solution set SC(O,I )” specified by a system of linear constraints in O-l variables. Additionally, several cost functions c,,., ,,c~ are given. The max-line...

This paper proposes a distributed consensus algorithm for linear event-based heterogeneous multi-agent systems (MAS). The proposed scheme is event-triggered in the sense that an agent selectively transmits its information within its local neighbourhood based on a directed network topology under the fulfillment of certain conditions. Using the Lyapunov stability theorem, the system constraints a...

The problem of aggregating multiple criteria to form overall objective functions is of considerable importance in many disciplines. The most commonly used aggregation is based on the weighted sum. The ordered weighted averaging (OWA) aggregation, introduced by Yager, uses the weights assigned to the ordered values (i.e. to the worst value, the second worst and so on) rather than to the specific...

This paper considers the problem of designing a state feedback control law which minimizes multiple quadratic performance objectives in the presence of uncertain linear plant dynamics Vec tor optimization techniques are used to minimize upper bounds on each performance objective guaranteed cost By exploiting the linear uncertainty bound introduced by Bernstein the vector optimization problem is...

i This paper describes a solution technique mr Linear Programming problems with multiple objective functions. In this type of problem it is often necessary to replace the concept of "optimgm" with that of "best compromise". In contrast with methods dealing with a priori weighted sums of the objective functions, the method described here involves a sequential exploration of solutions. This explo...

We consider the asymptotic behavior of the Newton/log barrier method for inequality constrained optimization. We show that, when the objective function is linear, an eeective step can be taken along the Newton direction after each reduction in the barrier parameter, leading to eecient performance during the nal stages of the algorithm. This behavior contrasts with the case of a nonlinear object...

We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...

This study presents a method to determine weights of objectives in multi objective linear programming without decision maker/s preference. The method is developed by modifying Belenson and Kapur’s approach under fuzziness. It is used two-person zero-sum game with mixed strategies. Degree of linear membership functions of objectives are used in pay-off matrix. The proposed method is shown with a...

This proof-of-concept study investigated whether a time-frequency EEG approach could be used to examine vection (i.e., illusions of self-motion). In the main experiment, we compared the event-related spectral perturbation (ERSP) data of 10 observers during and directly after repeated exposures to two different types of optic flow display (each was 35° wide by 29° high and provided 20 s of motio...