The fuzzy optimization problem is one of the prominent topics in the broad area of artificial intelligence. It is applicable in the field of non-linear fuzzy programming. Its application as well as practical realization can been seen in all the real world problems. In this paper a large scale non-linear fuzzy programming problem was solved by hybrid optimization techniques like Line Search (LS)...

This paper deals with the problem of automatic rule generation for fuzzy systems design. The proposed approach is based on hybrid artificial bee colony (ABC) optimization and weighted least squares (LS) method and aims to find the structure and parameters of fuzzy systems simultaneously. More precisely, two ABC based fuzzy modeling strategies are presented and compared. The first strategy uses ...

Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called  $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...

Probabilistic or stochastic programming is a framework for modeling optimization problems that involve uncertainty.In this paper, we focus on multi-objective linear programmingproblems in which the coefficients of constraints and the righthand side vector are fuzzy random variables. There are several methodsin the literature that convert this problem to a stochastic or<b...

This note establishes a limiting formula for the conic Lagrangian dual of convex infinite optimization problem, correcting classical version Karney [Math. Programming 27 (1983) 75-82] semi-infinite programs. A reformulation problem with single constraint leads to corresponding dual, called sup-dual, and also primal in case when strong Slater condition holds, which entails sup-duality.

Gauge functions significantly generalize the notion of a norm, and gauge optimization, as defined by [R. M. Freund, Math. Programming, 38 (1987), pp. 47–67], seeks the element of a convex set that is minimal with respect to a gauge function. This conceptually simple problem can be used to model a remarkable array of useful problems, including a special case of conic optimization, and related pr...

This paper presents a fuzzy optimization model to solve multicriteria decision making (MCDM) systems based on a fuzzy analytic hierarchy process (fuzzy AHP). To deal with the imprecise judgments of decision makers, a fuzzy AHP decision making model is proposed as an evaluation tool, where the expert’s comparison judgments are translated into fuzzy numbers. Unlike the conventional fuzzy AHP meth...

A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructure...

Gauge functions significantly generalize the notion of a norm, and gauge optimization, as defined by Freund (1987), seeks the element of a convex set that is minimal with respect to a gauge function. This conceptually simple problem can be used to model a remarkable array of useful problems, including a special case of conic optimization, and related problems that arise in machine learning and ...