نتایج جستجو برای: constrained problems

تعداد نتایج: 648337  

1994
Wen-Chih Huang Cheng-Yan Kao Jorng-Tzong Horng

In this paper, we introduce a genetic algorithm approach for set covering problems. Since the set covering problems are constrained optimization problems we utilize a new penalty function to handle the constraints. In addition, we propose a mutation operator which can approach the optima from both sides of feasible/infeasible borders. We experiment with our genetic algorithm to solve several in...

Journal: :bulletin of the iranian mathematical society 2012
n. mahdavi-amiri mohammad reza ansari

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of n...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

Salahi,

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...

M. Rezaee–Pajand, Y. Kadkhodaye Bahre

This study focuses on the optimization of the plane structure. Sequential quadratic programming (SQP) will be utilized, which is one of the most efficient methods for solving nonlinearly constrained optimization problems. A new formulation for the second order sensitivity analysis of the two-dimensional finite element will be developed. All the second order required derivatives will be calculat...

1992
Eitan Altman

The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure. Second, to introduce nite approximation methods. We deene the occupation measures and obtain properties of the set of all achievable occupation measures under the diierent admissible policies. We est...

A. Kaveh , M. Ilchi Ghazaan,

The failure probability of the structures is one of the challenging problems in structural engineering. To obtain the reliability index introduced by Hasofer and Lind, one needs to solve a nonlinear equality constrained optimization problem. In this study, four of the most recent metaheuristic algorithms are utilized for finding the design point and the failure probability of problems with cont...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید