The free parametrization for linear programming with bounded variables
The Friendship Theorem
In this article we prove the friendship theorem according to the article [1], which states that if a group of people has the property that any pair of persons have exactly one common friend, then there is a universal friend, i.e. a person who is a friend of every other person in the group
The gradient method for non-differentiable operators in product Hilbert spaces and applications to elliptic systems of quasilinear differential equations.
The gradient projection method for solving an optimal control problem
A gradient method for solving an optimal control problem described by a parabolic equation is considered. The gradient projection method is applied to solve the problem. The convergence of the projection algorithm is investigated.
The grouping differential evolution algorithm for multi-dimensional optimization problems
The Hull-White model and multiobjective calibration with consistent curves: empirical evidence.
The impact of uncertain parameters on ratchetting trends in hypoplasticity
Perturbed parameters are considered in a hypoplastic model of granular materials. For fixed parameters, the model response to a periodic stress loading and unloading converges to a limit state of strain. The focus of this contribution is the assessment of the change in the limit strain caused by varying model parameters.
The inverse maximum flow problem considering l∞ norm
The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast O(m⋅log(n)) time complexity algorithm for solving this problem is presented, where m is the number of arcs and n is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The algorithm...
The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
The island model as a Markov dynamic system
Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators....
The labeling method on two-dimensional networks
The Lagrange multipliers theorem for locally convex metric spaces
The Largest Subdeterminant of a Matrix
The Lazy Travelling Salesman Problem in
We study a parameter (σ) dependent relaxation of the Travelling Salesman Problem on . The relaxed problem is reduced to the Travelling Salesman Problem as 0. For increasing σ it is also an ordered clustering algorithm for a set of points in . A dual formulation is introduced, which reduces the problem to a convex optimization, provided the minimizer is in the domain of convexity of the relaxed functional. It is shown that this last condition is generically satisfied, provided σ is large enough. ...
The linear programming approach to deterministic optimal control problems
Given a deterministic optimal control problem (OCP) with value function, say , we introduce a linear program and its dual whose values satisfy . Then we give conditions under which (i) there is no duality gap
The logistic decision making in management accounting with genetic algorithms and fuzzy sets.
The logistics problems in business environments deal with assignation from a number of sources to a number of destinations. Each source offers amounts of goods, while each destination demands quantities of these goods. The object is to find the cheapest transporting schedule that satisfies the demand without violating supply restraints. In this paper we propose to use Fuzzy Sets to represent the previsional information related to costs, demands and other variables. Moreover, we suggest including...
The method of bilinear programming for nonconvex quadratic programming
The minimum value of as the quality control criterion
The minimum-entropy algorithm and related methods for calibrating asset-pricing models.
The MOORA method and its application to privatization in a transition economy