نتایج جستجو برای: continuous time optimization problem

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

Journal: :مدیریت زنجیره تأمین 0
محبوبه کبیری زمانی مهدی بیجاری

optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...

Journal: :J. Optimization Theory and Applications 2011
Bin Li Changjun Yu Kok Lay Teo Guang-Ren Duan

In this paper, we consider a class of optimal control problems subject to equality terminal state constraints and continuous state and control inequality constraints. By using the control parametrization technique and a time scaling transformation, the constrained optimal control problem is approximated by a sequence of optimal parameter selection problems with equality terminal state constrain...

Journal: :journal of mathematical modeling 2015
kamele nassiri pirbazari mehdi azari

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...

2004
V. Antunes de Oliveira

We prove that the notion of KT-invexity for continuous-time nonlinear optimization problem is a necessary and sufficient condition for global optimality of a KarushKuhn-Tucker point.

Journal: :Applied Mathematics and Computation 2007
Majid Darehmiraki Hasan Mishmast Nehi

A lot of current research in DNA computing has been directed towards solving hard combinatorial problems. Among them Knapsack problem is one of the most common problems which have been studied intensively in the last decade attracting both theorists and practicians. Fractional Knapsack Problem is easily solvable by greedy strategy, but 0/1 Knapsack Problem is not possible to solve in this metho...

2004
Alexander Tartakovski Martin Schaaf Rainer Maximini Ralph Bergmann

The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, ...

Journal: :RAIRO - Operations Research 2009
Mustapha Bouhtou Guillaume Erbs

This paper investigates the problem of maximizing the revenue of a telecommunications operator by simultaneously pricing point-to-point services and allocating bandwidth in its network, while facing competition. Customers are distributed into market segments, i.e., groups of customers with a similar preference for the services. This preference is expressed using utility functions, and customers...

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

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