A Genetic Algorithm for Composing Music
A genetic algorithm for solving multiple warehouse layout problem
A genetic based approach to the type I structure identification problem.
A geometric point of view on mean-variance models
This paper deals with the mathematics of the Markowitz theory of portfolio management. Let E and V be two homogeneous functions defined on ℝⁿ, the first linear, the other positive definite quadratic. Furthermore let Δ be a simplex contained in ℝⁿ (the set of admissible portfolios), for example Δ : x₁+ ... + xₙ = 1, . Our goal is to investigate the properties of the restricted mappings (V,E):Δ → ℝ² (the so called Markowitz mappings) and to classify them. We introduce the notion of a generic model...
A geometrical method in combinatorial complexity
A lower bound for the number of comparisons is obtained, required by a computational problem of classification of an arbitrarily chosen point of the Euclidean space with respect to a given finite family of polyhedral (non-convex, in general) sets, covering the space. This lower bound depends, roughly speaking, on the minimum number of convex parts, into which one can decompose these polyhedral sets. The lower bound is then applied to the knapsack problem.
A global method for some class of optimization and control problems.
A Global Stochastic Optimization Method for Large Scale Problems
In this paper, a new hybrid simulated annealing algorithm for constrained global optimization is proposed. We have developed a stochastic algorithm called ASAPSPSA that uses Adaptive Simulated Annealing algorithm (ASA). ASA is a series of modifications to the basic simulated annealing algorithm (SA) that gives the region containing the global solution of an objective function. In addition, Simultaneous Perturbation Stochastic Approximation (SPSA)...
A Globalization Scheme for the Generalized Gauss-Newton Method.
A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints
This paper introduces a neurodynamics optimization model to compute the solution of mathematical programming with equilibrium constraints (MPEC). A smoothing method based on NPC-function is used to obtain a relaxed optimization problem. The optimal solution of the global optimization problem is estimated using a new neurodynamic system, which, in finite time, is convergent with its equilibrium point. Compared to existing models, the proposed model has a simple structure, with low complexity. The...
A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start from an arbitrary...
A goal programming model for selecting a facility location site
A good approximation of the inventory level in a perishable inventory system
A good approximation of the inventory level in a (Q, r) perishable inventory system
This paper derives a good approach to approximating the expected inventory level per unit time for the continuous review (Q, r) perishable inventory system. Three existing approximation approaches are examined and compared with the proposed approach. Three stockout cases, including the full backorder, the partial backorder, and the full lost sales cases, which customers or material users generally use to respond to a stockout condition are considered. This study reveals the fact that the...
A gradient-type algorithm for the numerical solution of two-player zero-sum differential game problems
A Gradient-Type Method for the Equilibrium Programming Problem With Coupled Constraints
A Group Decision-Making Aggregation Process
A Hamilton-Jacobi approach to junction problems and application to traffic flows
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a “junction”, that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison principle. We also prove existence and stability of solutions. The two challenging difficulties are the singular geometry of the domain and the discontinuity of the Hamiltonian. As far as discontinuous Hamiltonians are concerned, these results seem to be new. They...
A heavy-traffic theorem for the GI/G/1 queue with a Pareto-type service time distribution.
A heuristic algorithm for the flowshop scheduling problem
A heuristic approach for determining lot sizes and schedules using power-of-two policy.