A procedure is developed for determining two-group linear discriminant classifiers that misclassify the fewest number of observations in the training sample. An experimental study confirms the value of this approach. ...
详细信息
A procedure is developed for determining two-group linear discriminant classifiers that misclassify the fewest number of observations in the training sample. An experimental study confirms the value of this approach. [ABSTRACT FROM AUTHOR]
Manufacturing enterprises today have to face the volatility of markets, characterized by a decreasing production volume and an increasing number of product variants to meet customer expectations. Traditional dedicated...
详细信息
Manufacturing enterprises today have to face the volatility of markets, characterized by a decreasing production volume and an increasing number of product variants to meet customer expectations. Traditional dedicated manufacturing lines (DML) have been replaced by flexible manufacturing systems (FMS) and, recently, by the systems that combine features of DML and FMS, i.e., by reconfigurable manufacturing systems (RMS). Appropriate manufacturing support and optimization systems for FMS and RMS will advance the quality and effectiveness of reconfigurable manufacturing. This paper proposes an original mixed integer linear programming (MILP) model for decision support in configuration and reconfiguration of the manufacturing system. The modeled problem is a certain development of the known machine loading problem MLP. In this approach, we generate a highly parameterized model based on a set of constraints and a set of questions. Different mathematical programming (MP) - based solvers are proposed to solve this model. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
It has been shown that in the case of finite games, games with a small Maximum Pairwise Difference (MPD) to a potential game share some of their favorable static and dynamic characteristics. In this paper, we extend t...
详细信息
ISBN:
(纸本)9781467320665
It has been shown that in the case of finite games, games with a small Maximum Pairwise Difference (MPD) to a potential game share some of their favorable static and dynamic characteristics. In this paper, we extend these results to games in which strategy sets can be either finite, or closed intervals of the real line;and utility functions are polynomials in the players' actions. We define a notion of distance in the space of polynomial games in terms of the Maximum Differential Difference (MDD) between two games, and relate this concept to their MPD. We also show that a nearby polynomial potential game can be obtained from the solution of a semidefinite program. We then use polynomial potential games to study the static and dynamic properties of nearby polynomial games. In particular, we relate the approximate equilibria and approximate better response dynamics of a polynomial game to those of a nearby polynomial potential game in terms of their MDD.
Wind is the fastest growing renewable energy source for generating electricity, but economic research lags behind. In this study, therefore, we examine the economics of integrating large-scale wind energy into an exis...
详细信息
Wind is the fastest growing renewable energy source for generating electricity, but economic research lags behind. In this study, therefore, we examine the economics of integrating large-scale wind energy into an existing electrical grid. Using a simple grid management model to investigate the impact of various levels of wind penetration on grid management costs, we show that costs of reducing CO2 emissions by relying more on wind power depend on the generation mix of the existing electrical grid and the degree of wind penetration, with costs ranging from $44 to well over $1000 per tonne of CO2 reduced. Costs are lowest if wind displaces large amounts of fossil fuel production and there is some hydroelectric power to act as a buffer. Hydro capacity has the ability to store wind generated power for use at more opportune times. If wind does nothing more than replace hydro or nuclear power, however, the environmental benefits (reduced CO2 emissions) of investing in wind power are small.
Designing well structured websites has long been a challenge to facilitate effective user navigation. The reason for poor website design is that the web developers understanding of website structure is considerably di...
详细信息
ISBN:
(纸本)9781479938346
Designing well structured websites has long been a challenge to facilitate effective user navigation. The reason for poor website design is that the web developers understanding of website structure is considerably different from that of the users. The reorganization of a website structure changes the location of familiar items. They would not be frequently performed to improve the navigability. The existing mathematical programming model facilitates user navigation on a website with minimal changes to its current structure. It is appropriate for informational websites whose content are static and relatively stable over time. It allows a page to have more links than the out-degree threshold if the cost is reasonable. Number of relevant mini sessions decreases as path threshold increases. Thus the mathematical programming model focuses on enhancing the design of existing links before adding new links. To improve the navigability further, an enhanced model using Graph Partitioned Clustering algorithm is proposed. It is used to group the potential users with similar navigation pattern from preprocessed web log data. Clustering results include number of visits made to a single webpage, most frequently viewed page and navigation behavior of the users. To minimize the average weighted shortest distance between pages and the average surfing distance, the enhanced mathematical programming model is proposed and applied to the clustered results. After identifying the existing links to be improved and new links to be added, the web site current structure has to be reorganized. Thus, it will improve the user navigation on a website effectively.
Purpose This study aims to design a supply chain network in an uncertain environment while exists two options for distribution of the perishable product and production lot-sizing is concerned. Design/methodology/appro...
详细信息
Purpose This study aims to design a supply chain network in an uncertain environment while exists two options for distribution of the perishable product and production lot-sizing is concerned. Design/methodology/approach Owing to the complexity of the mathematical model, a solution approach based on a Lagrangian relaxation (LR) heuristic is developed which provides good-quality upper and lower bounds. Findings The model output is discussed through various examples. The introduction of some enhancements and using some heuristics results in better outputs in the solution procedure. Practical implications This paper covers the modeling of some real-world problems in which demand is uncertain and managers face making some concurrent decisions related to supply chain management, transportation and logistics and inventory control issues. Furthermore, considering the perishability of product in modeling makes the problem more practically significant as these days there are many supply chains handling dairy and other fresh products. Originality/value Considering uncertainty, production, transshipment and perishable product in the inventory-routing problem makes a new variant that has not yet been studied. The proposed novel solution is based on the LR approach that is enhanced by some heuristics and some valid inequalities that make it different from the current version of the LR used by other studies.
Distribution warehouses are considered in this paper with the aim of scheduling the transportation of pallet and roll pallet loads from the storage area to the gates at which the trucks arrive. Transportation activiti...
详细信息
ISBN:
(纸本)9781479948451
Distribution warehouses are considered in this paper with the aim of scheduling the transportation of pallet and roll pallet loads from the storage area to the gates at which the trucks arrive. Transportation activities are carried out by forklift AGVs that can move freely along the warehouse's aisles (guide paths are not considered). In this paper, an optimization procedure is proposed, which is based on three sequential phases. In the first phase, the number of AGVs to be allocated to each arrived truck is determined;in the second phase, an AGV-to-truck assignment problem is solved;in the third phase, the single tasks are assigned to and sequenced on the AGVs. All phases are based on the formalization and solution of a specific mathematical programming problem, and a heuristic procedure is also proposed to solve a part of the third phase.
In the normal life span of large enterprises, the strategic management of IT often evolves. Existing services must be replaced with new services without impairing operations. The problem of scheduling such replacement...
详细信息
In the normal life span of large enterprises, the strategic management of IT often evolves. Existing services must be replaced with new services without impairing operations. The problem of scheduling such replacement is of critical importance for the success of the operation. We analyze this problem from a quantitative point of view, underlining the trade-off nature of its solutions. We formalize this multiobjective optimization problem as a mathematical programming formulation. We discuss its theoretical properties and show that real-world instances can be solved by standard off-the-shelf tools.
The concept of multitasking mathematical programs is discussed, and an application of multitasking to the multiple-cost-row linear programming problem is considered. Based on this, an algorithm for solving the Linear ...
详细信息
A model for solving very large item selection problems is presented. The model builds on previous work in binary programming applied to test construction. Expert test construction practices are applied to situations i...
详细信息
A model for solving very large item selection problems is presented. The model builds on previous work in binary programming applied to test construction. Expert test construction practices are applied to situations in which all specifications for item selection cannot necessarily be met. A heuristic for selecting items that satisfy the constraints in the model also is presented. The heuristic is particularly useful for situations in which the size of the test construction problem exceeds the limits of current implementations of linear programming algorithms. A variety of test construction problems involving real test specifications and item data from actual test assemblies were investigated using the model and the heuristic.
暂无评论