In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. We show that under certain assumptions this problem can be reduced to the continuous knapsack problem (CKP). We present a new fast ǫ-optimal algorithm for solving CKP instances with asymmetric concave reward functions. We also ...

Self-adaptation is becoming a standard method for optimizing mutational parameters within evolutionary programming. The majority of these efforts have been applied to continuous optimization problems. This paper offers a preliminary investigation into the use of self-adaptation for discrete optimization using the traveling salesman problem. Two self-adaptive approaches are analyzed. The results...

This paper considers the maximum coverage location problem (MCLP) in a continuous formulation. It is assumed that domain and family of geometric objects arbitrary shape are specified. necessary to find such cover greatest possible amount domain. A mathematical model MCLP proposed form an unconstrained nonlinear optimization problem. Python computational geometry packages were used calculate are...

We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0–1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in the BDD. As a test case we apply the method t...

for Continuous-Time Linear Systems Xiajiao Wang, Jun Wu, Weihua Xu, Sheng Chen, Xiaoliang Wang National Laboratory of Industrial Control Technology, Institute of Advanced Process Control, Zhejiang University, Hangzhou 310027 (E-mail: [email protected]) Department of Electronics and Computer Science,University of Southampton, Southampton, SO17 1BJ,UK 3) Department of Electronics, College of...

This paper proposes a new hybrid technique called ”partial parameter uniformization” to hybrid discreteand continuous-time models for batch sizing and scheduling problems. The uniformization method simpli...es a problem by ignoring the di¤erent values of some parameters that the problem can take, which can facilitate the solution of some complex combinatorial optimization problems. Good feasibl...

مغر اقبسم ةددحم ديروتلا ةرتف نأ ضارتفاب نوزخملا لئاسم لجل ىلثملا ةسايسلا ديدحت متي ام ةداع اهنأ ت رصانع ةدع نم نوكت ةلباق ل لثم مكحتل ليغشتلا تقو ، لإا ةرتف دادع ، نمز اظتنلاا ر ، ةلوانملا ةدم ، و ةعفدلا صحف ةدم . ةعجارم ماظن ةساردب موقن ةقرولا هذه يف يئاوشعلا عباطلا وذ رمتسملا نوزخملا دادعلإا تقوو ةعفدلا مجح ىلع ديروتلا ةرتف دمتعت امدنع . جتانآ اهريدقت نكمي ديروتلا ةرتف نأ ضرتفن امآ صحفلاو...

In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...

We develop a new mesh adaptive technique for the numerical solution of partial differential equations (PDEs) using the hp-version of the finite element method (hp-FEM). The technique uses a combination of approximation and interpolation error estimates to generate anisotropic triangular elements as well as appropriate polynomial approximation degrees. We present a hp-version of the continuous m...

In this paper we propose a novel continuous time model based on state task network for the problem of scheduling m products in n continuous processing units with simultaneous arrival of liquid inputs and multiple intermediate upliftment dates. The units can process only one product line at a time and are buffered by fixed capacity storage tanks. An optimization model for the problem tries to ba...