检索结果-内蒙古大学图书馆

Improvement of models for determination of flexible factor type in data envelopment analysis

MEASUREMENT 2019年 137卷 49-57页

作者： Kiyadeh, Majid Sedighi Hassan Saati, Saber Kordrostami, Sohrab Islamic Azad Univ Dept Appl Math Lahijan Branch Lahijan Iran Islamic Azad Univ Dept Math North Tehran Branch Tehran Iran Islamic Azad Univ Dept Math Lahijan Branch Lahijan Iran

The role of some factors is not completely clear as an input or an output in many real applications of Data Envelopment Analysis (DEA). In other words, a factor can be used as an input by some Decision-Making Units (DMUs) while it may play an output role in other DMUs. This type of factors are called flexible factors. To improve the models for determining the type of flexible factors, two models were presented in this article in which flexible factors are added to be used in the best situation. In this way, factors in both output and input roles will optimize productivity with maximum efficiency without any change in the productivity level. The proposed models showed more consistency to achieve the desired goals in DEA as compared to similar models. Eventually, the proposed models were compared with existing models through a numerical example. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Data envelopment analysis Flexible factors binary programming Slacks-based measure of efficiency Second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

Computing Weakly Reversible Deficiency Zero Network Translations Using Elementary Flux Modes

引用

BULLETIN OF MATHEMATICAL BIOLOGY 2019年第5期81卷 1613-1644页

作者： Johnston, Matthew D. Burton, Evan San Jose State Univ Dept Math One Washington Sq San Jose CA 95192 USA

We present a computational method for performing structural translation, which has been studied recently in the context of analyzing the steady states and dynamical behavior of mass-action systems derived from biochemical reaction networks. Our procedure involves solving a binary linear programming problem where the decision variables correspond to interactions between the reactions of the original network. We call the resulting network a reaction-to-reaction graph and formalize how such a construction relates to the original reaction network and the structural translation. We demonstrate the efficacy and efficiency of the algorithm by running it on 508 networks from the European Bioinformatics Institutes' BioModels database. We also summarize how this work can be incorporated into recently proposed algorithms for establishing mono- and multistationarity in biochemical reaction systems.

关键词： Biochemical reactions Deficiency Multistationarity binary programming

来源：评论

学校读者我要写书评

暂无评论

Increasing procurement efficiency through optimal e-commerce enablement scheduling

引用

JOURNAL OF PUBLIC PROCUREMENT 2019年第2期19卷 90-107页

作者： Cholette, Susan Clark, Andrew G. Ozluk, Ozgur San Francisco State Univ Dept Decis Sci San Francisco CA 94132 USA Univ Calif San Francisco Strateg Sourcing Unit San Francisco CA 94143 USA MEF Univ Dept Ind Engn Istanbul Turkey

Purpose This study aims to show how cost savings can be achieved through optimizing the scheduling of e-commerce enablements. The University of California is one of the largest, most prestigious public education and research systems in the world, yet diminished state support is driving the search for system-wide cost savings. Design/methodology/approach This study documents the preparation for and rollout of an e-procurement system across a subset of campuses. A math programing tool was developed for prioritizing the gradual rollout to generate the greatest expected savings subject to resource constraints. Findings The authors conclude by summarizing the results of the rollout, discussing lessons learned and their benefit to decision-makers at other public institutions. Originality/value The pilot program comprising three campuses has been predicted to yield $1.2m in savings over a one-year period;additional sensitivity analysis with respect to savings, project timelines and other rollout decisions illustrate the robustness of these findings.

关键词： Procurement e-Commerce Enablements Scheduling binary programming

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Cutting of Master Reels and Stocked Rolls in Solving Trim Loss Minimization Problem at Paper Mill 10

Simultaneous Cutting of Master Reels and Stocked Rolls in So...

引用

10th IEEE International Conference on Mechanical and Intelligent Manufacturing Technologies (ICMIMT)

作者： Aziz, Asnaf Razaullah Ali, Liaqat Naeem, Khawar Shakoor, Abdul Univ Technol Dept Mech Engn Technol Nowshera KPK Pakistan Univ Engn & Technol Dept Ind Engn Peshawar KPK Pakistan Univ Engn & Technol Dept Mech Engn Peshawar KPK Pakistan

ISBN: (纸本)9781538679722

Several studies have found methods of optimizing order allocation and trim loss in paper industry. However, the resulting solution may not be adoptable due to some widths of stocked rolls exceed or less than those required for acceptable scheduling. To meet actual customer demand and better suitability of results, a new decision model has been presented which can be used for simultaneous cutting of master reels and stocked rolls with limitation on cutting blades at winder. The objective is to fulfill customer need using minimum possible number of master reels and stocked rolls. The problem is solved by simplex method which generally leads to non-integer optimal solution. Phase-II is solved by a new method to make the final solution integer using binary programming. Mathematical and decision models are given and a numerical example has been solved to illustrate the applicability of proposed method.

关键词： Trim Loss Simplex Method binary programming Stepwise Approach

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING

EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACK...

引用

作者： Li, Jingqun McMaster University

学位级别：博士

In this work, we propose a novel convex dual approach to the multidimensional dimensional assignment problem, which is an NP-hard binary programming problem. It is shown that the proposed dual approach is equivalent to the Lagrangian relaxation method in terms of the best value attainable by the two approaches. However, the pure dual representation is not only more elegant, but also makes the theoretical analysis of the algorithm more tractable. In fact, we obtain a su cient and necessary condition for the duality gap to be zero, or equivalently, for the Lagrangian relaxation approach to nd the optimal solution to the assignment problem with a guarantee. Also, we establish a mild and easy-to-check condition, under which the dual problem is equivalent to the original one. In general cases, the optimal value of the dual problem can provide a satisfactory lower bound on the optimal value of the original assignment problem. We then extend the purely dual formulation to handle the more general multidimensional assignment problem. The convex dual representation is derived and its relationship to the Lagrangian relaxation method is investigated once again. Also, we discuss the condition under which the duality gap is zero. It is also pointed out that the process of Lagrangian relaxation is essentially equivalent to one of relaxing the binary constraint condition, thus necessitating the auction search operation to recover the binary constraint. Furthermore, a numerical algorithm based on the dual formulation along with a local search strategy is presented. Finally, the newly proposed algorithm is shown to outperform the Lagrangian relaxation method in a number of multi-target tracking simulations.

关键词： binary programming Optimization Multi-target tracking assignment problem

来源：评论

学校读者我要写书评

暂无评论

A methodology to optimally site and design municipal solid waste transfer stations using binary programming

引用

RESOURCES CONSERVATION AND RECYCLING 2012年 60卷 89-98页

作者： Chatzouridis, Constantinos Komilis, Dimitrios Democritus Univ Thrace Dept Environm Engn Lab Solid & Hazardous Waste Management GR-67100 Xanthi Greece

Mathematical programming has been often used to optimize municipal solid waste management and transfer systems. The objective of this work was to develop a practical methodology to aid in the optimal design of a solid waste collection network in regions with well-specified boundaries. The objective function was a non-linear equation that minimized total collection cost. The cost comprised the capital and operating costs of: (i) the waste transfer stations, (ii) the waste collection vehicles, (iii) the semitrailers and tractors as well as the waste collection within a community, and the cost to haul the wastes to the transfer stations or to the landfills. The adjustable (decision) variables were binary variables that designated whether a path between two nodes is valid or not. binary variables were also used to designate whether a transfer station should be constructed or not. In this methodology, the waste production nodes and their waste production rates were specified. The locations of all candidate waste transfer stations were designated using two alternative GIS-based siting methodologies;the locations of the final nodes (landfills) were precisely specified too. The actual travel distances and times among all nodes were the main input variables. The model was developed in an Excel (R) spreadsheet and was applied to a Hellenic region that has 53 municipalities. The candidate transfer stations sited in the region were 47 and one or two landfills were present in the system. The optimal solution suggested that 47 and 6 municipalities should direct their wastes to 12 transfer stations and to 2 landfills, respectively. The 12 transfer stations should then transfer their wastes to their adjacent landfills. The optimal collection cost was (sic)42.4 t(-1). A sensitivity analysis concluded that fuel cost was the most sensitive parameter in the model. (C) 2011 Elsevier B.V. All rights reserved.

关键词： binary programming Collection Municipal solid wastes Mathematical optimization Waste transfer stations Cost minimization

来源：评论

学校读者我要写书评

暂无评论

A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 2012年第12期92卷 1026-1043页

作者： Browne, P. A. Budd, C. Gould, N. I. M. Kim, H. A. Scott, J. A. Univ Bath Dept Math Sci Bath BA2 7AY Avon England STFC Rutherford Appleton Lab Numer Anal Grp Didcot OX11 0QX Oxon England Univ Bath Dept Mech Engn Bath BA2 7AY Avon England

We present a method for finding solutions of large-scale binary programming problems where the calculation of derivatives is very expensive. We then apply this method to a topology optimization problem of weight minimization subject to compliance and buckling constraints. We derive an analytic expression for the derivative of the stress stiffness matrix with respect to the density of an element in the finite-element setting. Results are presented for a number of two-dimensional test *** (c) 2012 John Wiley & Sons, Ltd.

关键词： topology optimization buckling eigenvalue structural optimization binary programming

来源：评论

学校读者我要写书评

暂无评论

Exaktní penalizace v optimalizaci

Exaktní penalizace v optimalizaci

引用

作者： Šešulka, Marek Charles University of Prague

This thesis deals with one of the possible different approaches to solving nonlinear optimization problems by convertion to finding non-bounded extrema of function, where constrains are transfered to objective function via penalty function. We will introduce exterior penalty function method and appropriate algorithm for solving this type for problems. The thesis also deals with exact penalty functions, which do not requires limit approximation of the penalty pa- rameter to infinity. Then we deal with integer binary nonlinear progamming, where several suitable penalty functions are presented to solve this type of pro- blem. In the numerical part, the thesis deals with the minimization of risk at the specifed minimum expected return on the sparse portfolio. We observe the effect of changing the penalty parameter on the results of ten different minimization problems calculating risk of sparsity portfolios. 1

关键词： exact penalization nonlinear programming penalty function method binary programming

来源：评论

学校读者我要写书评

暂无评论

Context out classifier

Context out classifier

引用

作者： Hrebik, Radek Kukal, Jaromir Czech Technical University in Prague Faculty of Nuclear Sciences and Physical Engineering Department of Software Engineering Brehova 7 Prague 1 115 19 Czech Republic

Novel context out learning approach is discussed as possibility of using simple classifiers which is background of hidden class system. There are two ways how to perform final classification. Having a lot of hidden classes we can build their unions using binary optimization task. Resulting system has the best possible sensitivity over all output classes. Another way is to perform second level linear classification as referential approach. The presented techniques are demonstrated on traditional iris flower task. © 2018, Brno University of Technology. All rights reserved.

关键词： binary programming Classification Cluster union Imperfect learning

来源：评论

学校读者我要写书评

暂无评论

Context Out Classifier

Context Out Classifier

引用

作者： Hrebik, Radek Brno University of Technology

关键词： classification binary programming cluster union imperfect learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：