The relevance of planning non-hierarchical supply chains has increased due to growing collaboration among industrial and logistic organizations once this planning approach aims to optimize the supply chain while prese...
详细信息
We present an optimal signal timing policy for multi-phase intersections. The policy is optimal in the sense of minimizing the increase in the number of queuing vehicles, i.e. maximizing throughput, within one signal ...
详细信息
A multi-functional optimization algorithm for dynamical systems is proposed in this paper. The problem is formulated as a receding horizon control problem, and the current control is updated by using the gradient esti...
详细信息
Construction of difference schemes of high approximation orders for hyperbolic problems is still an important problem. For the construction of grid-characteristic methods, difference schemes were earlier analyzed in t...
详细信息
Construction of difference schemes of high approximation orders for hyperbolic problems is still an important problem. For the construction of grid-characteristic methods, difference schemes were earlier analyzed in the space of undetermined coefficients, where the coefficients of high order derivatives in the first differential approximation of the difference scheme were used as the objective function to be minimized. Other reasonable functionals in the space of undetermined coefficients that are linear in the coefficients of the scheme may be used. By solving a linear programming problem, difference schemes meeting various conditions can be chosen. An example of the linear functional related to the approximation properties of the problem is discussed. It is proposed to call it the generalized approximation condition. Based on this condition, a difference scheme of a novel class is built that has no analogs in the literature. The presentation uses the transport equation with a constant coefficient as an example.
The authors considered a mathematical model of a two-stage transportation problem with two-sided constraints on consumer demands and upper bounds on the capacities of intermediate points. They substantiated the necess...
详细信息
The authors considered a mathematical model of a two-stage transportation problem with two-sided constraints on consumer demands and upper bounds on the capacities of intermediate points. They substantiated the necessary and sufficient conditions for the consistency of the system of linear constraints for the corresponding linear programming problem. The article presents two mathematical models of a two-stage transportation problem to which one can reduce the original model. It also presents the results of computational experiments on applying the problem described to the optimal set partitioning problem using the CPLEX solver from the NEOS server.
The author formulates mixed Boolean linear programming problems to find the shortest route and the shortest cycle that pass through the given number of nodes in a complete graph. Their special cases provide formulatio...
详细信息
The author formulates mixed Boolean linear programming problems to find the shortest route and the shortest cycle that pass through the given number of nodes in a complete graph. Their special cases provide formulations of problems for finding the shortest Hamiltonian path and the shortest Hamiltonian cycle. The problems include no more than 2n(2) variables and no more than (n+1)(2) constraints, where n is the number of nodes of the complete graph.
In this note, we show how interval arithmetic can be used to give a solution to the linear programming problem which is guaranteed to be on the safe side of the true solution, where roundoff error is taken into account.
In this note, we show how interval arithmetic can be used to give a solution to the linear programming problem which is guaranteed to be on the safe side of the true solution, where roundoff error is taken into account.
We consider the optimal control problem for a stochastic sequence (not necessarily Markov) in which besides the main criterion there are a number of other functionals of the sample paths;their expectations must satisf...
详细信息
We consider the optimal control problem for a stochastic sequence (not necessarily Markov) in which besides the main criterion there are a number of other functionals of the sample paths;their expectations must satisfy a certain system of inequalities. The life time of the process is assumed to be finite and all basic spaces are Borel spaces. The paper studies some properties of the space of strategy measures (for example, we prove that the selectors correspond to extreme points of this space). The optimal control problem is reformulated in terms of the theory of abstract linearprogramming which allows us to obtain necessary and sufficient conditions of optimality. Moreover, the paper proves the existence of an optimal strategy and its form is established (a finite mixture of selectors);at the end some exactly solved examples are cited.
In this paper, the uncertainty of the demand in newsvendor problems is characterized by interval probabilities. The characteristics of interval probabilities, the method for estimating interval probabilities from subj...
详细信息
ISBN:
(纸本)9781424426294
In this paper, the uncertainty of the demand in newsvendor problems is characterized by interval probabilities. The characteristics of interval probabilities, the method for estimating interval probabilities from subject and decision criteria with interval probabilities are addressed. The newsvendor models under interval probabilities are proposed for obtaining the optimal order quantity.
This paper proposes a solution for solving a specific problem that requires a team of identical robots to collect in a specific order different types of resources scattered throughout an environment. A Petri net with ...
详细信息
ISBN:
(纸本)9781479948451
This paper proposes a solution for solving a specific problem that requires a team of identical robots to collect in a specific order different types of resources scattered throughout an environment. A Petri net with outputs models the environment, the team possible movements and the regions with resources. An iterative solution plans the team such that each robot collects and assembles resources in the required order. Each iteration step is based on a linear programming problem that is guaranteed to return a feasible firing vector for the Petri net system. A pseudo-code description of the procedure is given and a simulation example is included.
暂无评论