A dual-uncertainty-based chance-constrained model for municipal solid waste management

A double-sided dual-uncertainty-based chance-constrained programming (DDCCP) model was developed for supporting municipal solid waste management under uncertainty. The model was capable of tackling left-hand- and right-hand-side variables in constraints where those variables were affected by dual uncertainties (i.e. e.g. both fuzziness and randomness); and they were expressed as fuzzy random variables (FRVs). In this study, DDCCP model were formulated and solved based on stochastic and fuzzy chance-constrained programming techniques, leading to optimal solutions under different levels of constraints violation and satisfaction reliabilities. A long-term solid waste management problem was used to demonstrate the feasibility and applicability of DDCCP model. The obtained results indicated that DDCCP was effective in handling constraints with FRVs through satisfying them at a series of allowable levels, generating various solutions that facilitated evaluation of trade-offs between system economy and reliability. The proposed model could help decision makers establish cost-effective waste-flow allocation patterns under complex uncertainties, and gain in-depth insights into the municipal solid waste management system.     

Global optimization of signomial mixed-integer nonlinear programming problems with free variables

Mixed-integer nonlinear programming (MINLP) problems involving general constraints and objective functions with continuous and integer variables occur frequently in engineering design, chemical process industry and management. Although many optimization approaches have been developed for MINLP problems, these methods can only handle signomial terms with positive variables or find a local solution. Therefore, this study proposes a novel method for solving a signomial MINLP problem with free variables to obtain a global optimal solution. The signomial MINLP problem is first transformed into another one containing only positive variables. Then the transformed problem is reformulated as a convex mixed-integer program by the convexification strategies and piecewise linearization techniques. A global optimum of the signomial MINLP problem can finally be found within the tolerable error. Numerical examples are also presented to demonstrate the effectiveness of the proposed method.     

On the mixed integer signomial programming problems

This paper proposes an approximate method to solve the mixed integer signomial programming problem, for which the objective function and the constraints may contain product terms with exponents and decision variables, which could be continuous or integral. A linear programming relaxation is derived for the problem based on piecewise linearization techniques, which first convert a signomial term into the sum of absolute terms; these absolute terms are then linearized by linearization strategies. In addition, a novel approach is included for solving integer and undefined problems in the logarithmic piecewise technique, which leads to more usefulness of the proposed method. The proposed method could reach a solution as close as possible to the global optimum.     

A piecewise linearization framework for retail shelf space management models

Managing shelf space is critical for retailers to attract customers and optimize profits. This article develops a shelf-space allocation optimization model that explicitly incorporates essential in-store costs and considers space- and cross-elasticities. A piecewise linearization technique is used to approximate the complicated nonlinear space-allocation model. The approximation reformulates the non-convex optimization problem into a linear mixed integer programming (MIP) problem. The MIP solution not only generates near-optimal solutions for large scale optimization problems, but also provides an error bound to evaluate the solution quality. Consequently, the proposed approach can solve single category-shelf space management problems with as many products as are typically encountered in practice and with more complicated cost and profit structures than currently possible by existing methods. Numerical experiments show the competitive accuracy of the proposed method compared with the mixed integer nonlinear programming shelf-space model. Several extensions of the main model are discussed to illustrate the flexibility of the proposed methodology.     

A two-stage fuzzy robust integer programming approach for capacity planning of environmental management systems

In this study, a two-stage fuzzy robust integer programming (TFRIP) method has been developed for planning environmental management systems under uncertainty. This approach integrates techniques of robust programming and two-stage stochastic programming within a mixed integer linear programming framework. It can facilitate dynamic analysis of capacity-expansion planning for waste management facilities within a multi-stage context. In the modeling formulation, uncertainties can be presented in terms of both possibilistic and probabilistic distributions, such that robustness of the optimization process could be enhanced. In its solution process, the fuzzy decision space is delimited into a more robust one by specifying the uncertainties through dimensional enlargement of the original fuzzy constraints. The TFRIP method is applied to a case study of long-term waste-management planning under uncertainty. The generated solutions for continuous and binary variables can provide desired waste-flow-allocation and capacity-expansion plans with a minimized system cost and a maximized system feasibility.     

Robust optimization for interactive multiobjective programming with imprecise information applied to R&D project portfolio selection

A multiobjective binary integer programming model for R&D project portfolio selection with competing objectives is developed when problem coefficients in both objective functions and constraints are uncertain. Robust optimization is used in dealing with uncertainty while an interactive procedure is used in making tradeoffs among the multiple objectives. Robust nondominated solutions are generated by solving the linearized counterpart of the robust augmented weighted Tchebycheff programs. A decision maker’s most preferred solution is identified in the interactive robust weighted Tchebycheff procedure by progressively eliciting and incorporating the decision maker’s preference information into the solution process. An example is presented to illustrate the solution approach and performance. The developed approach can also be applied to general multiobjective mixed integer programming problems.     

An improved linearization strategy for zero-one quadratic programming problems

We present a new linearized model for the zero-one quadratic programming problem, whose size is linear in terms of the number of variables in the original nonlinear problem. Our derivation yields three alternative reformulations, each varying in model size and tightness. We show that our models are at least as tight as the one recently proposed in [7], and examine the theoretical relationship of our models to a standard linearization of the zero-one quadratic programming problem. Finally, we demonstrate the efficacy of solving each of these models on a set of randomly generated test instances.     

整数规划新进展

整数规划是对全部或部分决策变量为整数的最优化问题的模型、算法及应用等的研究, 是运筹学和管理科学中应用最广泛的优化模型之一. 首先简要回顾整数规划的历史和发展进程, 概述线性和非线性整数规划的一些经典方法. 然后着重讨论整数规划若干新进展, 包括0-1二次规划的半定规划~(SDP)~松弛和随机化方法, 带半连续变量和稀疏约束的优化问题的整数规划模型和方法, 以及0-1二次规划的协正锥规划表示和协正锥的层级半定规划~(SDP)~逼近. 最后, 对整数规划未来研究方向进行展望并对一些公开问题进行讨论.     

Nonlinear goal programming using multi-objective genetic algorithms

Goal programming is a technique often used in engineering design activities primarily to find a compromised solution which will simultaneously satisfy a number of design goals. In solving goal programming problems, classical methods reduce the multiple goal-attainment problem into a single objective of minimizing a weighted sum of deviations from goals. This procedure has a number of known difficulties. First, the obtained solution to the goal programming problem is sensitive to the chosen weight vector. Second, the conversion to a single-objective optimization problem involves additional constraints. Third, since most real-world goal programming problems involve nonlinear criterion functions, the resulting single-objective optimization problem becomes a nonlinear programming problem, which is difficult to solve using classical optimization methods. In tackling nonlinear goal programming problems, although successive linearization techniques have been suggested, they are found to be sensitive to the chosen starting solution. In this paper, we pose the goal programming problem as a multi-objective optimization problem of minimizing deviations from individual goals and then suggest an evolutionary optimization algorithm to find multiple Pareto-optimal solutions of the resulting multi-objective optimization problem. The proposed approach alleviates all the above difficulties. It does not need any weight vector. It eliminates the need of having extra constraints needed with the classical formulations. The proposed approach is also suitable for solving goal programming problems having nonlinear criterion functions and having a non-convex trade-off region. The efficacy of the proposed approach is demonstrated by solving a number of nonlinear goal programming test problems and an engineering design problem. In all problems, multiple solutions (each corresponding to a different weight vector) to the goal programming problem are found in one single simulation run. The results suggest that the proposed approach is an effective and practical tool for solving real-world goal programming problems.     

A multi-parametric programming approach for constrained dynamic programming problems

In this work, we present a new algorithm for solving complex multi-stage optimization problems involving hard constraints and uncertainties, based on dynamic and multi-parametric programming techniques. Each echelon of the dynamic programming procedure, typically employed in the context of multi-stage optimization models, is interpreted as a multi-parametric optimization problem, with the present states and future decision variables being the parameters, while the present decisions the corresponding optimization variables. This reformulation significantly reduces the dimension of the original problem, essentially to a set of lower dimensional multi-parametric programs, which are sequentially solved. Furthermore, the use of sensitivity analysis circumvents non-convexities that naturally arise in constrained dynamic programming problems. The potential application of the proposed novel framework to robust constrained optimal control is highlighted.     

Inexact joint-probabilistic chance-constrained programming with left-hand-side randomness: An application to solid waste management

In practical waste management systems, amounts of waste transported and treated are not always equal on a daily basis. To distinguish between these two kinds of amounts and reflect their random relationships effectively, an inexact joint-probabilistic left-hand-side chance-constrained programming (IJLCP) method was developed and applied to a municipal solid waste management problem under dual uncertainties. Dual uncertainties are defined as two kinds of uncertainties existing in the same programming model. Improving upon conventional right-hand-side chance-constrained programming, the IJLCP can not only reflect uncertainties presented in terms of interval parameters (unit transportation/treatment costs, capacities of waste treatment facilities, waste generation rates, waste transportation/treatment amounts and so on) and left-hand-side random variables (the relationship between waste transportation and treatment amounts), but also examine the reliability of satisfying (or risk of violating) the entire system constraints. A non-equivalent but sufficient linearization form of IJLCP for solving this type of problem was proposed and proved in a straightforward manner. The performance of IJLCP was analyzed under scenarios at joint and individual probabilities and compared with the corresponding internal-parameter programming model. The results indicated that the net system costs would both decrease with increasing joint probability levels and decrease slightly at different individual probabilities with the same joint probabilities. The two types of dual uncertainties were discussed as well.     

Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems

Many global optimization approaches for solving signomial geometric programming problems are based on transformation techniques and piecewise linear approximations of the inverse transformations. Since using numerous break points in the linearization process leads to a significant increase in the computational burden for solving the reformulated problem, this study integrates the range reduction techniques in a global optimization algorithm for signomial geometric programming to improve computational efficiency. In the proposed algorithm, the non-convex geometric programming problem is first converted into a convex mixed-integer nonlinear programming problem by convexification and piecewise linearization techniques. Then, an optimization-based approach is used to reduce the range of each variable. Tightening variable bounds iteratively allows the proposed method to reach an approximate solution within an acceptable error by using fewer break points in the linearization process, therefore decreasing the required CPU time. Several numerical experiments are presented to demonstrate the advantages of the proposed method in terms of both computational efficiency and solution quality.     

Decision making under uncertainty: A semi-infinite programming approach

The subject of this paper is the formulation and discussion of a semi-infinite linear vector optimization problem which extends multiple objective linear programming problems to those with an infinite number of objective functions and constraints. Furthermore it generalizes in some way semi-infinite programming. Besides the statement of some immediately derived results which are related to known results in semi-infinite linear programming and vector optimization, the problem mentioned above is interpreted as a decision model, under risk or uncertainty containing continuous random variables. Thus we treat the case of an infinite number of occuring states of nature. These types of problems frequently occur within aspects of decision theory in management science.     

改进遗传算法优化非线性规划问题

针对遗传算法在处理优化问题上的独特优势,主要研究遗传算法的改进,并将其应用于优化非线性规划问题.在进化策略上,采用群体精英保留方式,将适应度值低的个体进行变异;交叉算子采用按决策变量分段交叉方式,提高进化速度;在优化有约束非线性规划问题时,引入算子修正法,对非可行个体进行改善.MATLAB仿真实验表明,方法是一种有效的、可靠的、方便的方法.     

Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach

Most facility selection and production planning approaches assume centralized decision making using monolithic models. In this paper, we address a capacitated plant selection problem in a decentralized manufacturing environment where the principal firm and the auxiliary plants operate independently in an organizational hierarchy. A non-monolithic model is developed for plant selection in the decentralized decision making process. The developed model considers the independence relationship between the principal firm and the selected plants. It also takes into account the opportunity costs of over-setting production capacities in the opened plants. The developed mathematical programming model is a two-level nonlinear programming model with integer and continuous decision variables. It was transformed into an equivalent single level model, linearized and solved by available optimization software. Computational examples are presented.     

A new reformulation-linearization technique for bilinear programming problems

This paper is concerned with the development of an algorithm for general bilinear programming problems. Such problems find numerous applications in economics and game theory, location theory, nonlinear multi-commodity network flows, dynamic assignment and production, and various risk management problems. The proposed approach develops a new Reformulation-Linearization Technique (RLT) for this problem, and imbeds it within a provably convergent branch-and-bound algorithm. The method first reformulates the problem by constructing a set of nonnegative variable factors using the problem constraints, and suitably multiplies combinations of these factors with the original problem constraints to generate additional valid nonlinear constraints. The resulting nonlinear program is subsequently linearized by defining a new set of variables, one for each nonlinear term. This RLT process yields a linear programming problem whose optimal value provides a tight lower bound on the optimal value to the bilinear programming problem. Various implementation schemes and constraint generation procedures are investigated for the purpose of further tightening the resulting linearization. The lower bound thus produced theoretically dominates, and practically is far tighter, than that obtained by using convex envelopes over hyper-rectangles. In fact, for some special cases, this process is shown to yield an exact linear programming representation. For the associated branch-and-bound algorithm, various admissible branching schemes are discussed, including one in which branching is performed by partitioning the intervals for only one set of variables x or y, whichever are fewer in number. Computational experience is provided to demonstrate the viability of the algorithm. For a large number of test problems from the literature, the initial bounding linear program itself solves the underlying bilinear programming problem.This paper was presented at the II. IIASA Workshop on Global Optimization, Sopron (Hungary), December 9–14, 1990.     

A hybrid inexact-stochastic water management model

An inexact-stochastic water management (ISWM) model is proposed and applied to a case study of water quality management within an agricultural system. The model is based on an inexact chance-constrained programming (ICCP) method, which improves upon the existing inexact and stochastic programming approaches by allowing both distribution information in B and uncertainties in A and C to be effectively incorporated within its optimization process. In its solution process, the ICCP model (under a given pi level) is first transformed into two deterministic submodels, which correspond to the upper and lower bounds for the desired objective function value. This transformation process is based on an interactive algorithm, which is different from normal interval analysis or best/worst case analysis. Interval solutions, which are feasible and stable in the given decision space, can then be obtained by solving the two submodels sequentially. Thus, decision alternatives can be generated by adjusting decision variable values within their solution intervals. The obtained ICCP solutions are also useful for decision makers to obtain insight regarding tradeoffs between environmental and economic objectives and between increased certainties and decreased safeties (or increased risks). Results of the case study indicate that useful solutions for the planning of agricultural activities in the water quality management system have been obtained. A number of decision alternatives have been generated and analyzed based on projected applicable conditions. Generally, some alternatives can be considered when water quality objective is given priority, while the others may provide compromises between environmental and economic considerations. The above alternatives represent various options between environmental and economic tradeoffs. Willingness to accept low agricultural income will guarantee meeting the water quality objectives. A strong desire to acquire high agricultural income will run into the risk of violating water quality constraints.     

Nuclear power plant optimal control by successive linear programming

An attempt to find optimal controls for an extremely load-following nuclear power plant during large load pick-ups is reported in this paper. The choice of the numerical method to solve this highly constrained dynamic optimization problem is discussed. The results reported demonstrate the efficacy of the successive linear programming method in tackling this problem without recourse to model linearization.The first author wishes to express his gratitude for many helpful discussions with Prof. S. L. Mehndiratta, Indian Institute of Technology, Bombay and Mr. B. F. Chamany, Bhabha Atomic Research Centre, Bombay, India.     

A mathematical model for identifying an optimal waste management policy under uncertainty

In the municipal solid waste (MSW) management system, there are many uncertainties associated with the coefficients and their impact factors. Uncertainties can be normally presented as both membership functions and probabilistic distributions. This study develops a scenario-based fuzzy-stochastic quadratic programming (SFQP) model for identifying an optimal MSW management policy and for allowing dual uncertainties presented as probability distributions and fuzzy sets being communicated into the optimization process. It can also reflect the dynamics of uncertainties and decision processes under a complete set of scenarios. The developed method is applied to a case study of long-term MSW management and planning. The results indicate that reasonable solutions have been generated. They are useful for identifying desired waste-flow-allocation plans and making compromises among system cost, satisfaction degree, and constraint-violation risk.     

Bivariate interval semi-infinite programming with an application to environmental decision-making analysis

This paper proposed a bivariate interval semi-infinite linear programming (BV-ISIP) method to address a type decision-making problem where various uncertainties exist in functional relations and parameter uncertainty. The performance of the method is also demonstrated via an illustrative example and an environmental decision-making problem. As BV-ISIP guarantees that each of the constraints is satisfied under all possible levels of independent variables, the system-failure risk can be reduced. The BV-ISIP solutions can be more robust to the variation of coefficients associated with independent variables than the ILP ones. Other features of BV-ISIP are as follows: (i) flexible decision-making schemes can be developed for decision makers in terms of the BV-ISIP solutions; (ii) BV-ISIP can conveniently be applied to many large-scale optimization problems as no significantly-increased computational costs are required; (iii) the method can easily be improved for addressing functional intervals associated with multiple independent variables.