Creation of groups in Networks of Excellence (NoEs) based on knowledge mapping and expertise is a set covering problem known to be non-polynomial. Therefore it is usually approached by heuristic methods which yield go...
详细信息
Creation of groups in Networks of Excellence (NoEs) based on knowledge mapping and expertise is a set covering problem known to be non-polynomial. Therefore it is usually approached by heuristic methods which yield good but not necessarily optimal coverage. Selecting teams to form a group within NoEs that are comprised of tens of teams can also be formulated and solved as an integer linear programming (ILP) problem whose solution is guaranteed to be optimal. This paper presents the ILP solution for team selection with typical objective functions. Several genetic algorithm-based methods are also compared to the optimal solution in terms of convergence (time and solution). The compared methods differ in selecting next-generation population schemes. The plain vanilla method is shown to be superior to both the roulette-based and the SUS methods.
A robot work cell has many peripheral devices and other components that may be placed inside the work envelop of a robot. The control computer not only has to interact with the peripheral devices but must also avoid c...
详细信息
A robot work cell has many peripheral devices and other components that may be placed inside the work envelop of a robot. The control computer not only has to interact with the peripheral devices but must also avoid collision with the physical components. Furthermore the work pieces can appear in various geometrical forms. All these objects are candidate obstacles in the work envelope. The problem is to find a shortest route for the end effector, avoiding collision with any of the object and still choose the shortest path to the target point. Present approaches used for the same purpose (1), (2), (3) and (4) are either computationaly inefficient or require expensive equipment. This paper offers an alternative approach of applying linear programming techniques to find the shortest path of the robot arm to the target point. For simplicity, the robot considered is a three dimensional gantry robot. The linear model formulated in this paper is based on the assumption that at any point in time obstacle coordinates of all vertices of obstacles are known to the controller. This model approximates the distance travelled by the end effector by calculating its motion in each axis. The model minimizes the sum total travel of the arm in the X, Y, Z directions.
The feasibility of solving LP problems on an Apple II is explored. The maximal size of problems that can be solved is found to be around 50 constraints and 100 variables. Run times may be over 12 hours in interpreted ...
详细信息
The feasibility of solving LP problems on an Apple II is explored. The maximal size of problems that can be solved is found to be around 50 constraints and 100 variables. Run times may be over 12 hours in interpreted Applesoft BASIC and over one hour in compiled Applesoft BASIC. Numerical stability is somewhat problematic. Nonetheless, the conclusion is that nicely scaled problems can be solved on the Apple II. [ABSTRACT FROM AUTHOR]
Meeting minimal daily requirements for nutrition and providing for human taste preferences, while operating on extremely limited funds, poses a difficult problem for charitable institutions such as the Union Rescue Mi...
详细信息
Meeting minimal daily requirements for nutrition and providing for human taste preferences, while operating on extremely limited funds, poses a difficult problem for charitable institutions such as the Union Rescue Mission of Knoxville, Tennessee. By using a tool such as linear programming, these institutions can determine the minimal cost of providing dietary and intangible needs. This type of analysis also provides the marginal cost increase associated with a more preferred diet, and allows the institution to determine the relative dollar value of variety and taste in food materials.
In this paper we formulate necessary and sufficient conditions for an arbitrary polyhedral set to be a positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are included in t...
详细信息
In this paper we formulate necessary and sufficient conditions for an arbitrary polyhedral set to be a positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are included in the analysis. A linear programming algorithm is presented that enables practical application of the results stated in this paper.
作者：
MIZUNO, NNYU
GRAD SCH BUSINESS ADMNEW YORKNY 10006 USA
This paper develops an efficient LP algorithm for solving single chain undiscounted Markov decision problems. The algorithm imposes, in the framework of the simplex method, the multiple choice constraints that exactly...
详细信息
This paper develops an efficient LP algorithm for solving single chain undiscounted Markov decision problems. The algorithm imposes, in the framework of the simplex method, the multiple choice constraints that exactly one basic variable be chosen from each Markov state. It is proved that the algorithm converges to an optimal solution in a finite number of steps.
linear programming is normally thought of as an application to be run on large computers, and for many problems that is the case. However, there are many problems of a suitable size to run on microcomputers, and a var...
详细信息
linear programming is normally thought of as an application to be run on large computers, and for many problems that is the case. However, there are many problems of a suitable size to run on microcomputers, and a variety of packages have appeared on the market in the last year or two claiming to solve linear programming problems on popular microcomputers. The paper considers the features to look for in a package and the type of problem to consider for solution on microcomputers.
To estimate the weight distribution of a binary linear code, a linear programming approach has been proposed, which leads to the best known values for BCH(255, k). Following that approach, we propose three methods whi...
详细信息
To estimate the weight distribution of a binary linear code, a linear programming approach has been proposed, which leads to the best known values for BCH(255, k). Following that approach, we propose three methods which give tighter estimates. At the same time, we find the distance of the dual of BCH[255, 199, 15].
A separable closed queueing network is decomposed into two subnetworks. The rates of the servers in one of the subnetworks are controllable in order to maximize the throughput of the other one. This problem of optimal...
详细信息
A separable closed queueing network is decomposed into two subnetworks. The rates of the servers in one of the subnetworks are controllable in order to maximize the throughput of the other one. This problem of optimal flow control is transformed to a linear programming problem. The optimal solution of the linear program yields the structure of the optimal control. Conditions for the network are given to guarantee the applicability of this approach.< >
Deals with a linear programming tool for Office Automation managers. Chance for managers to determine optimal future allocations of money for resources; 'Shadow costs' capability of linear programming.
Deals with a linear programming tool for Office Automation managers. Chance for managers to determine optimal future allocations of money for resources; 'Shadow costs' capability of linear programming.
暂无评论