### Abstract

An optimality criteria (OC)-based algorithm for optimization of a general class of nonlinear programming (NLP) problems is presented. The algorithm is only applicable to problems where the objective and constraint functions satisfy certain monotonicity properties. For multiply constrained problems which satisfy these assumptions, the algorithm is attractive compared with existing NLP methods as well as prevalent OC methods, as the latter involve computationally expensive active set and step-size control strategies. The fixed point algorithm presented here is applicable not only to structural optimization problems but also to certain problems as occur in resource allocation and inventory models. Convergence aspects are discussed. The fixed point update or resizing formula is given physical significance, which brings out a strength and trim feature. The number of function evaluations remains independent of the number of variables, allowing the efficient solution of problems with large number of variables.

Original language | English (US) |
---|---|

Pages (from-to) | 674-688 |

Number of pages | 15 |

Journal | Engineering Optimization |

Volume | 47 |

Issue number | 5 |

DOIs | |

State | Published - May 4 2015 |

### All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics