首页> 外文学位 >A circumscribed ellipsoid method for multiobjective programming and applications to robust optimization.
【24h】

A circumscribed ellipsoid method for multiobjective programming and applications to robust optimization.

机译:一种用于多目标编程的外接椭球方法,并应用于鲁棒优化。

获取原文
获取原文并翻译 | 示例

摘要

The purpose of this research is to propose an innovative methodology that solves practical business planning problems efficiently. Business planning models are typically prone to be complex and large-scale by nature. The new method proposed herein employs two main approaches to these inevitable conditions. The first approach is to build the basic model relatively simple with respect to its original structure. Then the method incorporates any additional information into the model framework by an interactive way in multiobjective optimization. The second approach is to employ an ellipsoid interior point algorithm in order to improve computational efficiency.; By utilizing parametric decomposition theory in multi-objective programming for the first approach, the method provides several alternative nondominated optimal solutions. In this way, intangible information which is normally difficult to formulate can be added into the model to satisfy the decision maker through the decision-making process. The interior point algorithm developed in this research for the second approach is an extension of a series of ellipsoid algorithms for multiobjective programming. The algorithms trace their origin to an ellipsoid method developed in the early 1980s. The proposed method is distinguished from the previous algorithms by several new concepts which include a linearization at the analytic center and an approximate efficient point with equivalent satisfactory levels of each objective function.; Two application examples were chosen from financial and production planning problems, and their robustness to cope with the uncertain business environment was discussed. The efficiency of the method was tested by codes written on Lotus 1-2-3 and GWBASIC software. The attempt to use microcomputers has also confirmed a better interface between the decision maker and the computer. Although the method was originally designed to solve a particular type of business planning problem, it is also applicable to various problems in other fields as well.
机译:这项研究的目的是提出一种创新的方法,可以有效地解决实际的业务计划问题。本质上,业务计划模型通常容易变得复杂且规模庞大。本文提出的新方法对这些不可避免的条件采用了两种主要方法。第一种方法是相对于其原始结构来相对简单地构建基本模型。然后,该方法通过多目标优化中的交互方式将任何其他信息合并到模型框架中。第二种方法是采用椭球内点算法,以提高计算效率。通过将参数分解理论用于多目标编程中的第一种方法,该方法提供了几种替代的非支配的最优解。这样,可以将通常难以表达的无形信息添加到模型中,以通过决策过程满足决策者的要求。本研究针对第二种方法开发的内点算法是对多目标编程的一系列椭圆算法的扩展。这些算法的起源可以追溯到1980年代初开发的椭圆体方法。所提出的方法与以前的算法的区别在于几个新概念,其中包括分析中心的线性化和每个目标函数具有相等令人满意水平的近似有效点。从财务和生产计划问题中选择了两个应用示例,并讨论了它们应对不确定的商业环境的鲁棒性。该方法的效率通过在Lotus 1-2-3和GWBASIC软件上编写的代码进行了测试。使用微型计算机的尝试还证实了决策者和计算机之间的更好接口。尽管该方法最初是为解决特定类型的业务计划问题而设计的,但它也适用于其他领域的各种问题。

著录项

  • 作者

    Mishina, Tsutomu.;

  • 作者单位

    The University of Oklahoma.;

  • 授予单位 The University of Oklahoma.;
  • 学科 Engineering Industrial.; Operations Research.
  • 学位 Ph.D.
  • 年度 1996
  • 页码 129 p.
  • 总页数 129
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 一般工业技术;运筹学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号