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.     

An improved stochastic programming model for supply chain planning of MRO spare parts

The maintenance, repair and operation (MRO) spare parts that are vital to machine operations are playing an increasingly important role in manufacturing enterprises. MRO spare parts supply chain management planning must be coordinated to ensure spare part availability while keeping the total cost to a minimum. Due to the specificity of MRO spare parts, randomness and uncertainties in production and storage should be quantified to formulate the problem in a mathematical model. Given these considerations, this paper proposes an improved stochastic programming model for the supply chain planning of MRO spare parts. In our stochastic programming model, the following improvements are made: First, we quantify the uncertain production time capacity as a random variable with a probability distribution. Second, the upper bound of the storage cost is modeled as a multi-choice variable in the constraint. To derive the equivalent deterministic model, the Lagrange interpolating polynomial approach is used. The results of the numerical examples validate the feasibility and efficiency of the proposed model. Finally, the model is tested in the supply chain planning of continuous caster (CC) bearings.     

Symmetric dual multiobjective programming

In this paper a pair of symmetric dual multiobjective programming problems is formulated and the duality theorems are established for pseudo-convex/pseudo-concave functions.     

Symmetric dual fractional programming

A pair of symmetric dual fractional programming problems is formulated and appropriate duality theorems are established.

---

Zusammenfassung Es wird ein symmetrisches Paar primaler und dualer Quotientenprogramme eingeführt, für das Dualitätsbeziehungen hergeleitet werden.

---

---

Research by this author was carried out while he was a visiting research fellow at the University of Melbourne.     

A stochastic programming model for water resource planning

A framework is offered for the evaluation of electricity generation and water supply for agricultural irrigation. This assessment is conducted through the construction of an appropriate stochastic optimization model. A recursive least squares algorithm is incorporated in the model which enables more accurate estimation of model parameters.     

A multicriteria fuzzy linear programming method for water supply system development planning

A method is presented for solving a multicriteria linear program where the coefficients of the objective functions and the constraints are fuzzy numbers of the L-R type. Assuming the aspiration levels for particular criteria to be fuzzy and basing on comparison of fuzzy numbers, the original problem is transformed into a multicriteria linear fractional program. The latter is solved using an interactive technique involving a linear programming procedure in the calculation phase. This method has been elaborated with a view to the application to the development of a water supply system.     

Complexity of stochastic dual dynamic programming

Mathematical Programming - Stochastic dual dynamic programming is a cutting plane type algorithm for multi-stage stochastic optimization originated about 30 years ago. In spite of its popularity in...     

An integer programming model for optimal pork marketing

Pork producers must determine when to sell pigs, which and how many pigs to sell, and to which packer(s) to sell them. We model the decision-making problem as a linear mixed-integer program that determines the marketing strategy that maximizes expected annual profit. By discretizing the barn population into appropriate weight and growth categories, we formulate an mixed-integer program that captures the effect of stocking space and shipping disruption on pig growth. We consider marketing to multiple packers via shipping policies reflecting operational sorting constraints. Utilizing data from Cargill Animal Nutrition, we implement the model to obtain solutions that characterize significant strategic departures from commonly-implemented industry rules-of-thumb and that possess the potential to increase profitability in an industry characterized by narrow profit margins.     

Yet another geometric programming dual algorithm

We describe an algorithm for the geometric programming dual problem which uses an adaptation of the generalized LP algorithm, proposed by Dantzig et al. twenty-five years ago for the chemical equilibrium problem, and show the slack primal constraints pose no numerical difficulties for this algorithm as they do for previous dual-based algorithms.     

An integer programming model for hierarchical workforce scheduling problem

In this paper, an integer programming model for the hierarchical workforce problem under the compressed workweeks is developed. The model is based on the integer programming formulation developed by Billionnet [A. Billionnet, Integer programming to schedule a hierarchical workforce with variable demands, European Journal of Operational Research 114 (1999) 105–114] for the hierarchical workforce problem. In our model, workers can be assigned to alternative shifts in a day during the course of a week, whereas all workers are assigned to one shift type in Billionnet’s model. The main idea of this paper is to use compressed workweeks in order to save worker costs. This case is also suitable for the practice. The proposed model is illustrated on the Billionnet’s example problem and the obtained results are compared with the Billionnet’s model results.     

Regularized dual method for nonlinear mathematical programming

For a nonlinear programming problem with equality constraints in a Hilbert space, a dual-type algorithm is constructed that is stable with respect to input data errors. The algorithm is based on a modified dual of the original problem that is solved directly by applying Tikhonov regularization. The algorithm is designed to determine a norm-bounded minimizing sequence of feasible elements. An iterative regularization of the dual algorithm is considered. A stopping rule for the iteration process is given in the case of a finite fixed error in the input data.     

Analysis of stochastic dual dynamic programming method

In this paper we discuss statistical properties and convergence of the Stochastic Dual Dynamic Programming (SDDP) method applied to multistage linear stochastic programming problems. We assume that the underline data process is stagewise independent and consider the framework where at first a random sample from the original (true) distribution is generated and consequently the SDDP algorithm is applied to the constructed Sample Average Approximation (SAA) problem. Then we proceed to analysis of the SDDP solutions of the SAA problem and their relations to solutions of the “true” problem. Finally we discuss an extension of the SDDP method to a risk averse formulation of multistage stochastic programs. We argue that the computational complexity of the corresponding SDDP algorithm is almost the same as in the risk neutral case.     

A dual perturbation view of linear programming

Solving standard-form linear prograrns via perturbation of the primal objective function has received much attention recently. In this paper, we investigate a new perturbation scheme which obtains a dual optimal solution by perturbing the dual feasible domain under different norms. A dual-to-primal conversion formula is also provided. We show that this new perturbation scheme actually generalizes the primal entropic perturbation approach to linear programming.Partially sponsored by the North Carolina Supercomputing Center 1994 Cray Research Grant and the National Textile Center Research Grant.     

A nonlinear Lagrangian dual for integer programming

Nonlinear Lagrangian theory offers a success guarantee for the dual search via construction of a nonlinear support of the perturbation function at the optimal point. In this paper, a new nonlinear dual formulation of an exponential form is proposed for bounded integer programming. This new formulation possesses an asymptotic strong duality property and guarantees a success in identifying a primal optimum solution. No actual dual search is needed in the solution process when the parameter of the nonlinear Lagrangian formulation is set to be large enough.     

Primal—dual methods for linear programming

Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal—dual, and may be derived from the application of Newton's method to different variants of the same system of nonlinear equations. A fourth variant of the same equations leads to a new primal—dual method.In each of the methods discussed, convergence is demonstrated without the need for a nondegeneracy assumption or a transformation that makes the provision of a feasible point trivial. In particular, convergence is established for a primal—dual algorithm that allows a different step in the primal and dual variables and does not require primal and dual feasibility.Finally, a new method for treating free variables is proposed.Presented at the Second Asilomar Workshop on Progress in Mathematical Programming, February 1990, Asilomar, CA, United StatesThe material contained in this paper is based upon research supported by the National Science Foundation Grant DDM-9204208 and the Office of Naval Research Grant N00014-90-J-1242.     

An economic evaluation model of supply chain flexibility

With the advent of the supply chain management concepts, business communities have been realizing that being competitive as a single company is no longer adequate; instead, competitiveness requires consideration of all channels in the supply chain. Despite its importance, the availability of the literature addressing supply chain flexibility is still limited to date. Although relationships between various types of flexibilities have been established, the degree to which one type of flexibility affects the other types and the system performance remains to be investigated. In particular, there is a lack of rigorous analytical models elucidating the relationships between the degree of flexibility in a system and the system level of performance. In this paper, a supply chain flexibility model is developed comprising labor flexibility, machine flexibility, routing flexibility, and information technology, with total system flexibility measured by an economic index. Outputs from the model can assist in making suitable production decisions to produce multiple products under an uncertain environment. Example solutions are given. This paper can help economic evaluation when supply chain flexibility and the factors affecting flexibility are to be improved. It can also assist in making supply chain flexibility-promotion decisions.     

An aggregate stochastic programming model for air traffic flow management

In this paper, we present an aggregate mathematical model for air traffic flow management (ATFM), a problem of great concern both in Europe and in the United States. The model extends previous approaches by simultaneously taking into account three important issues: (i) the model explicitly incorporates uncertainty in the airport capacities; (ii) it also considers the trade-off between airport arrivals and departures, which is a crucial issue in any hub airport; and (iii) it takes into account the interactions between different hubs.The level of aggregation proposed for the mathematical model allows us to solve realistic size instances with a commercial solver on a PC. Moreover it allows us to compute solutions which are perfectly consistent with the Collaborative Decision-Making (CDM) procedure in ATFM, widely adopted in the USA and which is currently receiving a lot of attention in Europe. In fact, the proposed model suggests the number of flights that should be delayed, a decision that belongs to the ATFM Authority, rather than assigning delays to individual aircraft.     

Primal and dual optimality criteria in convex programming

Summary This paper considers the problem of minimizing a convex differentiable function subject to convex differentiable constraints. Necessary and sufficient conditions (not requiring any constraints qualification) for a point to be an optimal solution are given in terms of a parametric linear program. Dual characterization theorems are then derived, which generalizes the classical results ofKuhn-Tucker andJohn.

---

Zusammenfassung Es wird das Problem betrachtet, eine konvexe differenzierbare Funktion unter konvexen differenzierbaren Nebenbedingungen zu minimieren. Unter Verwendung eines parametrischen linearen Optimierungsproblems werden notwendige und hinreichende Bedingungen für Optimalität eines Punktes angegeben, die keine constraints qualifications benötigen. Sodann werden duale Charakterisierungstheoreme hergeleitet, welche die klassischen Resultate vonKuhn-Tucker undJohn verallgemeinern.

---

---

This research was partly supported by Project No. NR 047-021, ONR Contract N00014-75-C-0569 with the Center for Cybernetic Studies, The University of Texas. Reproduction in whole or in part is permitted for any purpose of the United States Government.     

On some symmetric dual models in multiobjective programming

Certain omissions have been pointed out in some papers on symmetric duality in multiobjective programming. Corrective measures have also been discussed.     

Opposite problems and dual regularization in linear programming

For problems of linear programming, matrix games, and Chebyshev’s measures of systems of affine functions, we set opposite problems (in the same classes). We propose to analyze them jointly, using the duality.