LP problems constrained with D-FRIs

Authors

  • A. Ghodousian Faculty of Engineering Science, College of Engineering, University of Tehran, P.O. Box 11365-4563, Tehran, Iran
  • M. Jafarpour University of Tehran, College of Engineering, Faculty of Engineerng Science, Department of Algorithms and Computation
Abstract:

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. The resolution of the feasible region of the problem is firstly investigated when it is defined with max-Dombi composition. Based on some theoretical results, a necessary and sufficient condition and three other necessary conditions are derived for determining the feasibility. Moreover, in order to simplify the problem, some procedures are presented. It is shown that a lower bound is always attainable for the optimal objective value. Also, it is proved that the optimal solution of the problem is always resulted from the unique maximum solution and a minimal solution of the feasible region. A method is proposed to generate random feasible max-Dombi fuzzy relational inequalities and an algorithm is presented to solve the problem. Finally, an example is described to illustrate these algorithms.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving resource constrained shortest path problems with LP-based methods

In the resource constrained shortest path problem (RCSPP) there is a directed graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resource types with finite capacities. A minimum cost source-destination directed path is sought such that the total consumption of the arcs from each resource type does not ...

full text

LP-Based Approaches to Stationary-Constrained Markov Decision Problems

We study a class of Markov Decision Processes (MDPs) under stationary constraints (particularly but not exclusively, chance constraints). Our model focuses on problems where the state space is finite but the control at each state may take real values. It is straightforward to formulate the problem as a constrained nonlinear optimization problem, but solving it requires either projection, penalt...

full text

MOEA/D with Angle-based Constrained Dominance Principle for Constrained Multi-objective Optimization Problems

This paper proposes a novel constraint-handling mechanism named angle-based constrained dominance principle (ACDP) embedded in a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multiobjective optimization problems (CMOPs). To maintain the diversity of the working population, ACDP utilizes the information of the angle of solutions to adjust the dominance ...

full text

Lp-Norm Constrained Coding With Frank-Wolfe Network

We investigate the problem of Lp-norm constrained coding, i.e. converting signal into code that lies inside the Lp-ball and most faithfully reconstructs the signal. While previous works known as sparse coding have addressed the cases of `0 "norm" and L1-norm, more general cases with other p values, especially with unknown p, remain a difficulty. We propose the Frank-Wolfe Network (F-W Net), who...

full text

Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems

In this paper, we establish hardness and approximation results for various Lp–ball constrained homogeneous polynomial optimization problems, where p ∈ [2,∞]. Specifically, we prove that for any given d ≥ 3 and p ∈ [2,∞], both the problem of optimizing a degree–d homogeneous polynomial over the Lp–ball and the problem of optimizing a degree–d multilinear form (regardless of its super–symmetry) o...

full text

Solving Over-Constrained Problems with SAT

We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clauses and distinguish between hard and soft blocks. We then present two Max-SAT-based solvers for our formalism and an experimental investigation.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 50  issue issue 2

pages  59- 79

publication date 2018-12-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023