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

Product design with multiple suppliers for component variants

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2008年第2期112卷 723-741页

作者： Balakrishnan, Nagraj Raju Chakravarty, Amiya K. Clemson Univ Dept Management Clemson SC 29634 USA Northeastern Univ Coll Business Adm Boston MA 02115 USA

The issue of vendor choice has traditionally not been considered in determining the optimal set of products to produce. That is, component purchase has typically been considered only at the MRP explosion stage, well after the set of products to produce and their production quantities has been decided. This decoupling of roles may sometimes result in high acquisition cost of components. To control costs, it is crucial that unit prices of component variants, fixed costs of doing business with vendors, and their capabilities to supply different component variants be assessed before deciding which set of models to include in a product line. In our analysis, we have explicitly provided for this coupling between product choice and vendor selection, and have gone a step further by bringing in customers to determine the sales potential of the different models of a product that may be produced. We use our analysis to study the following issues: (1) how can a manufacturer decide which product models to offer and which vendors to select to offer components for these models, (2) under what situations are general vendors (who offer a larger variety of component variants) preferred to more focused vendors, (3) how much discount do focused vendors need to offer to compensate for their lack of versatility, (4) how does the fixed cost of vendor relationships influence the vendor selection decision, (5) how does the intensity of market competitiveness influence this decision, (6) how can a manufacturer work with a general vendor to exploit new market opportunities, and (7) how much incentive can a manufacturer offer focused vendors to get them to become more versatile in their capabilities. For each problem scenario, the output of our procedure tells us the set of models that should be chosen for a product line, production quantities of each model, specific vendors front whom component variants needed to produce these models should be procured, and profits to the manufacturer and eac

关键词： product mix product design vendor selection math programming

来源：评论

学校读者我要写书评

暂无评论

Incorporating Food-away-from-Home into the Thrifty Food Plan

Incorporating Food-away-from-Home into the Thrifty Food Plan

引用

作者： Zhang, Ge Virginia Tech | University

This study explores the impact of incorporating Food-away-from-Home (FAFH) into the Thrifty Food Plan (TFP). The new model of this study, FLEX, uses similar sets of datasets on prices, nutrition and average consumption pattern as those used in the TFP model. The 2001-2002 National Health and Nutrition Examination Survey (NHANES) data is used to generate average consumption and nutrient profiles. The relative price ratio of FAFH to FAH is assumed and fixed at 1.77. We compared nutrient intake, food intake and food expenditure amount across the FLEX, TFP, and the current low-income consumersâ consumption pattern. The overall finding is that moderate amount of FAFH can be a part of a balanced and nutritious diet and allowing FAFH as another food sources makes the diet recommendations relatively easier to follow. With the relative price assumption used in this study, considering FAFH does not make the diet plan unaffordable.

关键词： FAFH FLEX the TFP math programming Thesis

来源：评论

学校读者我要写书评

暂无评论

Computer simulation for optimizing assignment of civil airport gate

引用

26th Chinese Control Conference

作者： Wang Li Liu Chang you Civil Aviat Univ China Coll Aviat Automat Tianjin 300300 Peoples R China Civil Aviat Univ China Coll Econ & Management Tianjin 300300 Peoples R China

ISBN: (纸本)9787811240559

Airport gate assignment is to appoint a gate for the arrival or leave flight based on flights in-formation, assigning the airport gate with high efficiency and reason is a key task among the airport ground busyworks. Assigning the airport gate problem is a multi-objective optimization problem, this paper is based on the literature No. 1, which gives out a muti-objective mathematic model of airport gate assignment, according as the fact of airport confirming different right for different optimized objective, and gives out there arithmetics for the multi-objective mathematic. Simulation result shows the validity of this model and algorithm.

关键词： math programming airport gate assignment the degree of passenger satisfaction airport benefit computer simulation

来源：评论

学校读者我要写书评

暂无评论

Optimal stationing of radar pickets and anti-ballistic missile defenders for long range surveillance and tracking (LRS & T) and ballistic missile defense (BMD) operations

Optimal stationing of radar pickets and anti-ballistic missi...

引用

作者： Repass, Lawrence M. Naval Postgraduate School

学位级别：硕士

We describe major enhancements to the missile defense planning aid "JOINT DEFENDER" (JDEF). JDEF is the first system that shows how to evaluate and exploit new and anticipated improvements in interceptors, long-range surveillance and tracking capabilities, networked communications, and the ability of detecting platforms to cue intercepting ones downrange. We want to improve system-wide effectiveness, gauged here by the reduction of expected damage inflicted. We defend an asset list (DAL) of targets, characterized by their locations and values to us. Our defenders include pure "LOOKERs," radars and sensors of enemy missile launches, and "SHOOTERs," platforms with means to both detect and intercept enemy launches. JDEF optimally positions platforms that can be moved, and prescribes what each platform should do. JDEF can estimate the value to either opponent of secrecy, deception, or intelligence. JDEF is the only missile defense planning system using formal optimization. Among many advantages this conveys, JDEF is able to unambiguously quantify the difference among disparate plans. Although the JDEF planner can manually control any detail, the planner is well advised to let optimization suggest where to start.

关键词： Optimization math programming Theater Ballistic Missile Defense Joint Missile Defense

来源：评论

学校读者我要写书评

暂无评论

Envelope theorems for arbitrary choice sets

引用

ECONOMETRICA 2002年第2期70卷 583-601页

作者： Milgrom, P Segal, I Stanford Univ Dept Econ Stanford CA 94305 USA

The standard envelope theorems apply to choice sets with convex and topological structure, providing sufficient conditions for the value function to be differentiable in a parameter and characterizing its derivative. This paper studies optimization with arbitrary choice sets and shows that the traditional envelope formula holds at any differentiability point of the value function. We also provide conditions for the value function to be, variously, absolutely continuous, left- and right-differentiable, or fully differentiable. These results are applied to mechanism design, convex programming, continuous optimization problems, saddle-point problems, problems with parameterized constraints, and optimal stopping problems.

关键词： envelope theorem differentiable value function sensitivity analysis math programming mechanism design

来源：评论

学校读者我要写书评

暂无评论

Balancing and optimizing a portfolio of R&D projects

引用

NAVAL RESEARCH LOGISTICS 2001年第1期48卷 18-40页

作者： Beaujon, GJ Marin, SP McDonald, GC GM Corp Enterprise Syst Lab R&D Ctr Warren MI 48090 USA

A mathematical formulation of an optimization model designed to select projects fur inclusion in an R&D portfolio, subject to a. wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the: problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that Sap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and fives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the: literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is: s

关键词： risk knapsack problem math programming robustness project valuation planning under uncertainity

来源：评论

学校读者我要写书评

暂无评论

Balancing and optimizing a portfolio of R&D projects

引用

Naval Research Logistics (NRL) 2001年第1期48卷

作者： George J. Beaujon Samuel P. Marin Gary C. McDonald Enterprise Systems Laboratory General Motors R&D Center Warren Michigan 48090‐9055

A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown

关键词： risk knapsack problem math programming robustness project valuation planning under uncertainity

来源：评论

学校读者我要写书评

暂无评论

Assigning projects to optimize the utilization of employees' time and expertise

引用

COMPUTERS & CHEMICAL ENGINEERING 2000年第2-7期24卷 1013-1021页

作者： Bassett, M Dow AgroSci Indianapolis IN 46268 USA

The objective of the work described in this paper is to optimally assign projects or tasks to people in order to best utilize their expertise and minimize outside R&D contract, dollars spent in any given period of time. This capability is important to several globally leveraged groups within Dow AgroSciences that perform standardized activities to fulfill product development requirements. Both math programming and heuristic-based approaches are used to solve this problem. The heuristic allows for quick generation of solutions, while the math program is more rigorous but very time-consuming. This paper discusses the effort required to collect the data, formulate the math program, develop the heuristic and interpret the results. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： math programming heuristic assignment problem

来源：评论

学校读者我要写书评

暂无评论

Assigning projects to optimize the utilization of employees' time and expertise

Assigning projects to optimize the utilization of employees'...

引用

7th International Symposium on Process Systems Engineering

作者： Bassett, M Dow AgroSci Indianapolis IN 46268 USA

关键词： math programming heuristic assignment problem

来源：评论

学校读者我要写书评

暂无评论

Topological network design for SONET ring architecture

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 1998年第6期28卷 780-790页

作者： Luss, H Rosenwein, MB Wong, RT AT&T Bell Labs Holmdel NJ 07733 USA

Service restoration and survivability have become increasingly important in telecommunications network planning with the introduction of fiber optic, high speed networks, Recent technological advances, such as synchronous optical network (SONET) technology, promotes the use of interconnected rings in designing reliable networks. We describe a heuristic approach for designing networks comprised of interconnected rings, Our approach is particularly attractive for relatively sparse networks in which the set of all cycles (constituting the potential rings) can be determined at a reasonable computational effort. Most telecommunications networks would fall into this category. Given a set of nodes, with demand among all possible node-pairs, and a set of available links that connect the nodes (e.g., existing fiber links), the problem is to select an optimal subset of rings, utilizing only allowable links, such that each node is included in at least one ring and each ring is connected to at least one other ring at two or more nodes, Such a multiple ring network will ensure instantaneous restoration of service in case of a single link or single node failure. In our solution approach, we first generate a large set of candidate rings and approximate the cost of each ring based on the nodes that are served by the ring and based on the demands. We then apply a set covering algorithm that selects a (minimum cost) subset of the candidate rings such that each node is included on at least one ring. Finally, we select a few additional rings in order to achieve the required connectivity among the rings. me present computational results for realistic-size (e.g., 500 nodes) telecommunication networks.

关键词： algorithms integer programming math programming networks SONET

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：