• 제목/요약/키워드: Uncertain Programming

검색결과 61건 처리시간 0.024초

Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

  • Zhang, Xiang;Wang, Qina;Zhou, Jian
    • Industrial Engineering and Management Systems
    • /
    • 제12권1호
    • /
    • pp.9-15
    • /
    • 2013
  • An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights

  • Zhang, Bo;Peng, Jin
    • Industrial Engineering and Management Systems
    • /
    • 제11권1호
    • /
    • pp.18-25
    • /
    • 2012
  • IChinese postman problem is one of the classical combinatorial optimization problems with many applications. However, in application, some uncertain factors are frequently encountered. This paper employs uncertain programming to deal with Chinese postman problem with uncertain weight Within the framework of uncertainty theory, the concepts of expected shortest route, ${\alpha}$-shortest route, and distribution shortest route are proposed. After that, expected shortest model, and ${\alpha}$-shortest model are constructed. Taking advantage of properties of uncertainty theory, these models can be transf-ormed into their corresponding deterministic forms, which can be solved by classical algorithm..

Fixed Charge Transportation Problem and Its Uncertain Programming Model

  • Sheng, Yuhong;Yao, Kai
    • Industrial Engineering and Management Systems
    • /
    • 제11권2호
    • /
    • pp.183-187
    • /
    • 2012
  • In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.

A Transportation Problem with Uncertain Truck Times and Unit Costs

  • Mou, Deyi;Zhao, Wanlin;Chang, Xiaoding
    • Industrial Engineering and Management Systems
    • /
    • 제12권1호
    • /
    • pp.30-35
    • /
    • 2013
  • Motivated by the emergency scheduling in a transportation network, this paper considers a transportation problem, in which, the truck times and transportation costs are assumed as uncertain variables. To meet the demand in the practical applications, two optimization objectives are considered, one is the total costs and another is the completion times. And then, a multi-objective optimization model is developed according to the situation in applications. Because there are commensurability and conflicting between the two objectives commonly, a solution does not necessarily exist that is best with respective to the two objectives. Therefore, the problem is reduced to a single objective model, which is an uncertain programming with a chance-constrain. After some analysis, its equivalent deterministic form is obtained, which is a nonlinear programming. Based on a stepwise optimization strategy, a solution method is developed to solve the problem. Finally, the computational results are provided to demonstrate the effectiveness of our model and algorithm.

Semi-active bounded optimal control of uncertain nonlinear coupling vehicle system with rotatable inclined supports and MR damper under random road excitation

  • Ying, Z.G.;Yan, G.F.;Ni, Y.Q.
    • Coupled systems mechanics
    • /
    • 제7권6호
    • /
    • pp.707-729
    • /
    • 2018
  • The semi-active optimal vibration control of nonlinear torsion-bar suspension vehicle systems under random road excitations is an important research subject, and the boundedness of MR dampers and the uncertainty of vehicle systems are necessary to consider. In this paper, the differential equations of motion of the coupling torsion-bar suspension vehicle system with MR damper under random road excitation are derived and then transformed into strongly nonlinear stochastic coupling vibration equations. The dynamical programming equation is derived based on the stochastic dynamical programming principle firstly for the nonlinear stochastic system. The semi-active bounded parametric optimal control law is determined by the programming equation and MR damper dynamics. Then for the uncertain nonlinear stochastic system, the minimax dynamical programming equation is derived based on the minimax stochastic dynamical programming principle. The worst-case disturbances and corresponding semi-active bounded parametric optimal control are obtained from the programming equation under the bounded disturbance constraints and MR damper dynamics. The control strategy for the nonlinear stochastic vibration of the uncertain torsion-bar suspension vehicle system is developed. The good effectiveness of the proposed control is illustrated with numerical results. The control performances for the vehicle system with different bounds of MR damper under different vehicle speeds and random road excitations are discussed.

Multiperiod Mean Absolute Deviation Uncertain Portfolio Selection

  • Zhang, Peng
    • Industrial Engineering and Management Systems
    • /
    • 제15권1호
    • /
    • pp.63-76
    • /
    • 2016
  • Multiperiod portfolio selection problem attracts more and more attentions because it is in accordance with the practical investment decision-making problem. However, the existing literature on this field is almost undertaken by regarding security returns as random variables in the framework of probability theory. Different from these works, we assume that security returns are uncertain variables which may be given by the experts, and take absolute deviation as a risk measure in the framework of uncertainty theory. In this paper, a new multiperiod mean absolute deviation uncertain portfolio selection models is presented by taking transaction costs, borrowing constraints and threshold constraints into account, which an optimal investment policy can be generated to help investors not only achieve an optimal return, but also have a good risk control. Threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Based on uncertain theories, the model is converted to a dynamic optimization problem. Because of the transaction costs, the model is a dynamic optimization problem with path dependence. To solve the new model in general cases, the forward dynamic programming method is presented. In addition, a numerical example is also presented to illustrate the modeling idea and the effectiveness of the designed algorithm.

Uncertain Centralized/Decentralized Production-Distribution Planning Problem in Multi-Product Supply Chains: Fuzzy Mathematical Optimization Approaches

  • Khalili-Damghani, Kaveh;Ghasemi, Peiman
    • Industrial Engineering and Management Systems
    • /
    • 제15권2호
    • /
    • pp.156-172
    • /
    • 2016
  • Complex and uncertain issues in supply chain result in integrated decision making processes in supply chains. So decentralized (distributed) decision making (DDM) approach is considered as a crucial stage in supply chain planning. In this paper, an uncertain DDM through coordination mechanism is addressed for a multi-product supply chain planning problem. The main concern of this study is comparison of DDM approach with centralized decision making (CDM) approach while some parameters of decision making are assumed to be uncertain. The uncertain DDM problem is modeled through fuzzy mathematical programming in which products' demands are assumed to be uncertain and modeled using fuzzy sets. Moreover, a CDM approach is customized and developed in presence of fuzzy parameters. Both approaches are solved using three fuzzy mathematical optimization methods. Hence, the contribution of this paper can be summarized as follows: 1) proposing a DDM approach for a multi-product supply chain planning problem; 2) Introducing a coordination mechanism in the proposed DDM approach in order to utilize the benefits of a CDM approach while using DDM approach; 3) Modeling the aforementioned problem through fuzzy mathematical programming; 4) Comparing the performance of proposed DDM and a customized uncertain CDM approach on multi-product supply chain planning; 5) Applying three fuzzy mathematical optimization methods in order to address and compare the performance of both DDM and CDM approaches. The results of these fuzzy optimization methods are compared. Computational results illustrate that the proposed DDM approach closely approximates the optimal solutions generated by the CDM approach while the manufacturer's and retailers' decisions are optimized through a coordination mechanism making lasting relationship.

Ellipsoidal bounds for static response of framed structures against interactive uncertainties

  • Kanno, Yoshihiro;Takewaki, Izuru
    • Interaction and multiscale mechanics
    • /
    • 제1권1호
    • /
    • pp.103-121
    • /
    • 2008
  • This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the contributions of some non-structural elements, and hence we assume that the axial stiffness of each brace is uncertain. By using the $\mathcal{S}$-lemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for a braced frame under several uncertain circumstances.

Fuzzy programming for improving redundancy-reliability allocation problems in series-parallel systems

  • Liu, C.M.;Li, J.L.
    • International Journal of Reliability and Applications
    • /
    • 제12권2호
    • /
    • pp.79-94
    • /
    • 2011
  • Redundancy-reliability allocation problems in multi-stage series-parallel systems are addressed in this study. Fuzzy programming techniques are proposed for finding satisfactory solutions. First, a multi-objective programming model is formulated for simultaneously maximizing system reliability and minimizing system total cost. Due to the nature of uncertainty in the problem, the fuzzy set theory and technique are used to convert the deterministic multi-objective programming model into a fuzzy nonlinear programming problem. A heuristic method is developed to get satisfactory solutions for the fuzzy nonlinear programming problem. A Pareto optimal solution is found with maximal degree of satisfaction from the interception area of fuzzy sets. A case study that is related to the electronic control unit installed on aircraft engine over-speed protection system is used to implement the developed approach. Results suggest that the developed fuzzy multi-objective programming model can effectively resolve the fuzzy and uncertain problem when design goals and constraints are not clearly confirmed at the initial conceptual design phase.

  • PDF

ROBUST DUALITY FOR GENERALIZED INVEX PROGRAMMING PROBLEMS

  • Kim, Moon Hee
    • 대한수학회논문집
    • /
    • 제28권2호
    • /
    • pp.419-423
    • /
    • 2013
  • In this paper we present a robust duality theory for generalized convex programming problems under data uncertainty. Recently, Jeyakumar, Li and Lee [Nonlinear Analysis 75 (2012), no. 3, 1362-1373] established a robust duality theory for generalized convex programming problems in the face of data uncertainty. Furthermore, we extend results of Jeyakumar, Li and Lee for an uncertain multiobjective robust optimization problem.