Solving linear optimization problems with max-star composition equation constraints

In this paper an optimization model with a linear objective function subject to a system of fuzzy relation composition equations is presented. Since the non-empty feasible solution set of the fuzzy relation equations is generally a non-convex set, the conventional linear programming method will not...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 179; no. 2; pp. 654 - 661
Main Authors: Khorram, Esmaile, Ghodousian, Amin, Molai, Ali Abbasi
Format: Journal Article
Language:English
Published: New York, NY Elsevier Inc 15.08.2006
Elsevier
Subjects:
Calculus of variations and optimal control
Exact sciences and technology
Linear function optimization problem
Mathematical analysis
Mathematics
Max-star composition equations
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Numerical methods in optimization and calculus of variations
Sciences and techniques of general use
Linear function optimization problem
Max-star composition equations
Max-star composition equation
Numerical analysis
Linear function
Optimization method
Fuzzy relation
Linear programming
Mathematical programming
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper an optimization model with a linear objective function subject to a system of fuzzy relation composition equations is presented. Since the non-empty feasible solution set of the fuzzy relation equations is generally a non-convex set, the conventional linear programming method will not be suitable for solving such a problem. Therefore, an efficient solution procedure for such problems appears to be necessary. In this paper, firstly, we characterize the feasible solution set, and then introduce two efficient procedures for solving the problem. Finally, two concrete examples are included for more details.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2005.12.006