An Optimization Approach for Nonlinear Programming Problems with Interval Coefficients

DOI

10.2991/iccmcee-15.2015.192How to use a DOI?

Keywords

Nonlinear programming problem, interval coefficients, bilevel program.

Abstract

When some coefficients involved in nonlinear programming problems are taken as interval numbers, the problem becomes more challengeable than the original one. In the paper, a nonlinear programming problem with interval objective coefficients is considered, and a genetic algorithm is presented. Firstly, the original problem is transformed into a bilevel programming model without interval coefficients. In addition, a genetic algorithm is designed and used to deal with the transformed problem, in which the search space is decided by these intervals given in the original problem. Based on the proposed approach, the best and the worst optimal solutions as well as some intermediate solutions can be obtained. Finally, a computational example is solved and the results show that the proposed algorithm is efficient and robust.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Mei Ma
AU  - HeCheng Li
PY  - 2015/11
DA  - 2015/11
TI  - An Optimization Approach for Nonlinear Programming Problems with Interval Coefficients
BT  - Proceedings of the 2015 4th International Conference on Computer, Mechatronics, Control and Electronic Engineering
PB  - Atlantis Press
SP  - 1024
EP  - 1028
SN  - 2352-5401
UR  - https://doi.org/10.2991/iccmcee-15.2015.192
DO  - 10.2991/iccmcee-15.2015.192
ID  - Ma2015/11
ER  -