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

The minimal cost maximum matching of a graph

Unternehmensforschung Operations Research - Recherche Opérationnelle 1971年第1期15卷 196-210页

作者： De Maio, A.O. Roveda, C.A. Lehrstuhl für Betriebswirtschaftslehre Johannes Gutenberg-Universität Binger Str. 22 65 Mainz

This paper deals with the problem of finding the maximum matching of a weighted graph, having the minimum cost. This problem is solved via a branch and bound algorithm, derived directly from Land and Doig's technique. The linear programming problem associated with each step of the procedure is solved through a primal-dual algorithm. © 1971 Physica-Verlag.

关键词： programming problem Minimal Cost linear programming problem Weighted Graph Maximum Match

来源：评论

学校读者我要写书评

暂无评论

Effective Application of Knowledge Management System for Reverse Center Location problem

Effective Application of Knowledge Management System for Rev...

引用

IEEE International Conference on Advances in Computer Applications (ICACA)

作者： Nainar, B. JnNURM BSUP Wing Dept Bus Route Rd Ripon Bldg Madras Tamil Nadu India

ISBN: (纸本)9781509037704

Graphs are frequently rummage-sale to typical such effects as path linkages and communication networks, and several scientific questions have ascended from altered occurrences of the demand of what is an ideal location for a competence in a graph. In virtually all circumstances the category of capability to be established is one for which a "crucial" locality is optimum. The K-epicenter problem is unique of the conventional locality complications. The objective is to excellent a set of K-epicenter such that the extreme remoteness of a non-center to its adjoining epicenter is decreased. The problematic is used example to prototypical the situation of alternative amenities such as fire stations or hospitals, where the purpose is to have a tiniest definite rejoinder time between a patron and its epicenter. Bonday and Murthy originated the central concepts in 2014 (Bonday J.A. and Murthy U.S.R.) and he published many papers in these concepts. In earlier days many authors studied these concepts on trees. In the last decade a few papers have been published in graphs. It can see that K-epicenter problem is intimately related to another problem the dominating set problem. In this research Journal deals with the linear programming problem and the solution of its dual problem. Also this study and solve this reverse center problem which is the most important problem taken for this journal.

关键词： knowledge management reverse center location graph theory linear programming problem

来源：评论

学校读者我要写书评

暂无评论

Fast Synthesis of Optimal and Structurally Simple Supervisors for Automated Manufacturing Systems

Fast Synthesis of Optimal and Structurally Simple Supervisor...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Huang, Bo Zhou, MengChu Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781479986965

For automated manufacturing systems (AMSs), this paper presents a Petri net based deadlock prevention method to efficiently obtain an optimal supervisor with a compressed structure in terms of control places and added arcs. The optimal supervisor can be achieved by forbidding all first-met bad markings (FBMs) and permitting all legal markings. An iterative method for a lexicographic multiobjective integer linear program (LMILP) is formulated to design such a supervisor with a simple structure. At each iteration, a place invariant is designed to obtain an optimal control place by solving an LMILP whose objectives are first to forbid as many FBMs as possible, second to minimize the number of added arcs, and third to simplify coefficients of the place invariants. Instead of a single sizable linear program, several much smaller LMILPs are formulated, which can be solved much faster. Finally, a benchmark example is used to show the efficiency and effectiveness of the approach.

关键词： Automated manufacturing system deadlock prevention linear programming problem Petri net supervisor

来源：评论

学校读者我要写书评

暂无评论

linear Approach for Mathematical Modelling as a Tool for Efficient Portfolio Selection 19th

Linear Approach for Mathematical Modelling as a Tool for Eff...

引用

19th International Conference on Distributed Computer and Communication Networks (DCCN)

作者： Kryanev, Alexander Sliva, Darya Sinitsin, Andrey Natl Res Nucl Univ MEPhI Kashirskoe Shosse 31 Moscow 115409 Russia

ISBN: (纸本)9783319519173;9783319519166

This report introduces two approaches to the efficient portfolio selection problem, wherein the criteria and the constraints are linear with respect to control variables. The first approach consists of unconditioned optimization of the average expected efficiency value of a portfolio without imposing any additional constraints on the structure of selected portfolio. For this scheme the problem of effective portfolio formation is reduced to two linear programming problems, solving these for an efficient frontier may be effectively accomplished in closed form. The second scheme considers an additional set of group constraints, which can also be reduced to the problem of finding the Pareto fronts of two linear programming problems.

关键词： Efficient portfolio linear formulation Pareto frontier linear programming problem

来源：评论

学校读者我要写书评

暂无评论

On the stability of solutions under recursive programming

引用

Unternehmensforschung Operations Research - Recherche Opérationnelle 1966年第1期10卷 1-14页

作者： Sengupta, J.K. Tintner, G. Indian Institute of Management Calcutta India Department of Economics University of Southern California Los Angeles United States

Recursive linear programming is defined by a sequence of linear programming problems in which a recursive relation is built into the system through either the coefficients of the objective function, the constraint matrix, or the right-hand side parameters. Here we consider the case where the right-hand side parameters are subject to a recursive time relation indicating how current period plans are related to past expectations and performance. Our object here is twofold: first, to analyze the stability properties of a linear recursive programming (LRP) model and second, to indicate some basic extensions of the LRP in the light of what is generally called 'the active approach' of stochastic linear programming (SLP). Some simple theorems are developed in this connection and this is followed by a brief discussion of the possible lines of empirical applications. © 1966 Physica-Verlag.

关键词： Recursive Relation linear programming problem Constraint Matrix Stochastic linear programming Simple Theorem

来源：评论

学校读者我要写书评

暂无评论

linear programming with uncertain objective function: Minimax solution for relative loss

引用

Calcolo 1979年第2期16卷 125-141页

作者： De Angelis, V. Istituto di Calcolo delle Probabilità Facoltà di Scienze Statistiche Demografiche e Attuariali dell'Università di Roma Roma Italy

Given the uncertain linear cost function z=c′x, with parameter vector c belonging to a bounded convex polyhedron C and a set of linear constrainst with a bounded solution set X, a function F (x) is defined as representing the maximum relative loss with respect c∈C for a given x and the problem is set of finding x∈X minimizing F (x). The work is based on the theory of multiparametric linear programming and on the theory of mathematical programming with fractional objective function. The problem is conceived as a preliminary study of linear programming with stochastic objective function. © 1979 Instituto di Elaborazione della Informazione del CNR.

关键词： linear programming problem Relative Loss Stochastic problem Minimax Solution linear Cost Function

来源：评论

学校读者我要写书评

暂无评论

On Some Properties of K-type Block Matrices in the Context of Complementarity problem

On Some Properties of K-type Block Matrices in the Context o...

引用

International Conference on Mathematics and Computing (ICMC)

作者： Dutta, A. Das, A. K. Jadavpur Univ Kolkata 700032 India Indian Statist Inst 203 BT Rd Kolkata 700108 India

ISBN: (纸本)9789811993091;9789811993077;9789811993060

In this article, we introduce K-type block matrices which include two new classes of block matrices, namely block triangular K-matrices and hidden block triangular K-matrices. We show that the solution of linear complementarity problem with K-type block matrices can be obtained by solving a linear programming problem. We show that block triangular K-matrices satisfy the least element property. We prove that hidden block triangular K-matrices are Q(0) and processable by Lemke's algorithm. The purpose of this article is to study properties of K-type block matrices in the context of the solution of linear complementarity problem.

关键词： Z-matrix Hidden Z-matrix linear programming problem linear complementary problem Semi-sublattice P-matrix Q(0)-matrix

来源：评论

学校读者我要写书评

暂无评论

Maximizing Multicast Throughput in a Single-Hop Multi-Channel Wireless Network 33

Maximizing Multicast Throughput in a Single-Hop Multi-Channe...

引用

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Wasserman, David R. Hulbert, Douglas S. Space & Naval Warfare Syst Ctr Pacific San Diego CA USA

ISBN: (纸本)9781479967704

This paper studies multicast traffic in a wireless network in which all nodes are within communication range of each other and share multiple independent channels. A node in this network cannot simultaneously transmit and receive, and can only transmit on one channel at a time, but when not transmitting it can simultaneously receive all channels. It is shown that increased throughput may be achieved by using erasure coding, which eliminates the requirement that all recipients listen at the same time. For any given set of multicast sessions, throughput may be optimized subject to a fairness constraint by solving a certain linear programming problem.

关键词： linear programming multicast communication telecommunication traffic wireless channels erasure coding linear programming problem multicast throughput maximization multicast traffic single-hop multi-channel wireless network Encoding linear programming Reed-Solomon codes Schedules Throughput Vectors Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A linear programming APPROACH TOWARDS INDIVIDUATION LIGHTING SYSTEM WITH OPTIMAL ENERGY CONSUMPTION

A LINEAR PROGRAMMING APPROACH TOWARDS INDIVIDUATION LIGHTING...

引用

International Conference on Advanced Materials, Energy and Environmental Sustainability (ICAMEES)

作者： Divya, Chevikala Pai, Namratha Manipal Inst Technol Manipal Acad Higher Educ Dept Elect & Elect Engn Manipal 576104 Karnataka India

Energy consumption is considered to be scope for wide range of research. This paper is an attempt to the process of energy conservation in the field of lighting science. A classroom with multiple locations and different combinations of four luminaires were considered for the study. linear programming problem is used to optimize the energy consumption with respect to illuminance at particular location. This study depicts the relation between energy consumption and number of luminaires at certain location considering individual satisfaction as a dynamic factor. Result shows the effectiveness of the methodology on light energy consumption satisfying individual preferred illuminance. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： linear programming problem Energy conservation Individual preferred illuminance

来源：评论

学校读者我要写书评

暂无评论

Difference Schemes for a Drain Transfer Equation Based on Analysis in the Space of Undefined Coefficients

引用

Mathematical Models and Computer Simulations 2021年第3期13卷 395-407页

作者： Lobanov, A.I. Mirov, F.H. Moscow Institute of Physics and Technology (National Research University) Moscow Russian Federation

Abstract: A family of difference schemes on an explicit five-point stencil for the numerical solution of the linear transfer equation is considered. To construct and study the properties of difference schemes, a generalized approximation condition is used. Difference schemes in the space of undefined coefficients are analyzed. In this case, the problem of constructing the optimal difference scheme is reduced to a linear programming problem. A family of hybrid difference schemes is also considered. For them, the switching parameter will be the locally calculated dimensionless wavenumber. The analysis also shows that when constructing schemes with a higher approximation order, their local properties will be determined by the halved dimensionless wavenumber (in comparison with the scheme of the first approximation order). For the transfer equation with a linear sink, a family of difference schemes is also constructed based on such an analysis. In this case, more solutions to the linear programming problem are possible: schemes of a higher order of approximation on an unexpanded template (compact schemes) are among the optimal ones. The properties of the optimal schemes of a higher order of approximation in the case of an equation with a sink are determined by a dimensionless parameter that depends on both the wavenumber and the sink’s coefficient. Considering that for an equation with a sink, difference schemes have somewhat better computational qualities than for a homogeneous linear equation, when solving systems of the hyperbolic type by the splitting method, it is advisable to select the part with a linear sink and it is for this that a hybrid difference scheme is constructed that has a variable order of approximation on the solution of the differential problem. Numerical examples of the implemented schemes are given for the simplest linear equation. © 2021, Pleiades Publishing, Ltd.

关键词： complementary slackness conditions difference scheme linear programming problem transfer equation with a linear drain transport equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：