scholarly journals Graph-based algorithms for the efficient solution of optimization problems involving monotone functions

2019 ◽  
Vol 73 (1) ◽  
pp. 101-128
Author(s):  
Luca Consolini ◽  
Mattia Laurini ◽  
Marco Locatelli
1988 ◽  
Vol 42 (1-3) ◽  
pp. 471-487 ◽  
Author(s):  
Carl Brezovec ◽  
Gérard Cornuéjols ◽  
Fred Glover

2021 ◽  
Author(s):  
Mingxuan Zhao ◽  
Yulin Han ◽  
Jian Zhou

Abstract The operational law put forward by Zhou et al. on strictly monotone functions with regard to regular LR fuzzy numbers makes a valuable push to the development of fuzzy set theory. However, its applicable conditions are confined to strictly monotone functions and regular LR fuzzy numbers, which restricts its application in practice to a certain degree. In this paper, we propose an extensive operational law that generalizes the one proposed by Zhou et al. to apply to monotone (but not necessarily strictly monotone) functions with regard to regular LR fuzzy intervals (LR-FIs), of which regular fuzzy numbers can be regarded as particular cases. By means of the extensive operational law, the inverse credibility distributions (ICDs) of monotone functions regarding regular LR-FIs can be calculated efficiently and effectively. Moreover, the extensive operational law has a wider range of applications, which can deal with the situations hard to be handled by the original operational law. Subsequently, based on the extensive operational law, the computational formulae for expected values (EVs) of LR-FIs and monotone functions with regard to regular LR-FIs are presented. Furthermore, the proposed operational law is also applied to dispose fuzzy optimization problems with regular LR-FIs, for which a solution strategy is provided, where the fuzzy programming is converted to a deterministic equivalent first and then a newly-devised solution algorithm is utilized. Finally, the proposed solution strategy is applied to a purchasing planning problem, whose performances are evaluated by comparing with the traditional fuzzy simulation-based genetic algorithm. Experimental results indicate that our method is much more efficient, yielding high-quality solutions within a short time.


Author(s):  
Megha Vora ◽  
T. T. Mirnalinee

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.


2016 ◽  
pp. 1519-1544 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.


2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Valeriano A. De Oliveira ◽  
Marko A. Rojas-Medar

We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvexity is a necessary and suffcient condition for a vector Karush-Kuhn-Tucker solution to be a weakly efficient solution.


Author(s):  
Le Thanh Tung

The main aim of this paper is to study second-order sensitivity analysis in parametric vector optimization problems. We prove that the proper perturbation maps and the proper efficient solution maps of parametric vector optimization problems are second-order composed proto-differentiable under some appropriate qualification conditions. Some examples are provided to illustrate our results.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Zafar Iqbal ◽  
Saeid Nooshabadi ◽  
Ichitaro Yamazaki ◽  
Stanimire Tomov ◽  
Jack Dongarra

Sign in / Sign up

Export Citation Format

Share Document