首页> 外文会议>International Conference on Innovative Computing, Information and Control >A Product Mix Problem Based on Maximization of the Total Profit and Reduction of Excessive Inventories Including Uncertainty
【24h】

A Product Mix Problem Based on Maximization of the Total Profit and Reduction of Excessive Inventories Including Uncertainty

机译:产品混合问题是基于最大化的总利润和减少的过量库存,包括不确定性

获取原文

摘要

This paper considers a product mix problem both maximizing the total future profit and reducing excessive inventories including uncertainty with respect to future profits and customers' demands. Furthermore, since a decision maker has a goal with respect to the total future profit and each inventory of the product, in this paper, aspiration levels for them are also introduced. The proposal product mix problem is formulated as a multi-criteria programming problem considering maximizing all aspiration levels assumed to be fuzzy goals. Then, since each future return and customer's demand are assumed to be random variables, this problem including randomness is basically formulated as a multi-criteria stochastic programming problem. Since it is hard to solve it analytically, the transformations into deterministic equivalent problems are introduced and the efficient solution methods are constructed.
机译:本文考虑了产品混合问题,既可以最大限度地提高未来的盈利,减少过量库存,包括对未来利润和客户需求的不确定性。此外,由于决策者对未来的总利润和产品的每种库存有了一个目标,因此还介绍了他们的愿望水平。该提案产品混合问题被制定为一个多标准编程问题,考虑到最大化假定为模糊目标的所有抽吸级别。然后,由于假设每个未来的返回和客户的需求被认为是随机变量,因此这个问题包括随机性基本上被标记为多标准随机编程问题。由于难以分析地解决它,因此引入了确定性等同物问题的转换,并且构建了有效的解决方案方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号