28. Different types of feasibility problems via special membership functions
Invited abstract in session TB-3: Topics in nonlinear programming, stream contributed papers.
Thursday, 10:00 - 11:30Room: C 104
Authors (first author is the speaker)
| 1. | József Dombi
|
| Reseach Group of Artificial Intelligence, ELKH-SZTE |
Abstract
In this talk a universal approach is presented that can be used to find solutions to systems of equations and the feasibility regions described by linear and nonlinear inequalities. We introduce a sigmoid-type and a so-called distending function in order to determine feasibility regions. The combinations of the equalities and inequalities can be expressed by using continuous-valued logical expressions. We also propose new algorithm to find feasible points of linear, nonlinear, convex and non-convex feasibility problems.
Keywords
- Linear and nonlinear optimization
- Artificial intelligence based optimization methods and appl
- Convex and non-smooth optimization
Status: accepted
Back to the list of papers