A mathematical programming approach to optimal Markovian switching of Poisson arrival streams to queueing systems

Motivated by certain situations in manufacturing systems and communication networks, we look into the problem of maximizing the profit in a queueing system with linear reward and cost structure and having a choice of selecting the streams of Poisson arrivals according to an independent Markov chain. We view the system as a MMPP/GI/1 queue and seek to maximize the profits by optimally choosing the stationary probabilities of the modulating Markov chain. We consider two formulations of the optimization problem. The first one (which we call the PUT problem) seeks to maximize the profit per unit time whereas the second one considers the maximization of the profit per accepted customer (the PAC problem). In each of these formulations, we explore three separate problems. In the first one, the constraints come from bounding the utilization of an infinite capacity server; in the second one the constraints arise from bounding the mean queue length of the same queue; and in the third one the finite capacity of the buffer reflect as a set of constraints. In the problems bounding the utilization factor of the queue, the solutions are given by essentially linear programs, while the problems with mean queue length constraints are linear programs if the service is exponentially distributed. The problems modeling the finite capacity queue are non-convex programs for which global maxima can be found. There is a rich relationship between the solutions of the PUT and PAC problems. In particular, the PUT solutions always make the server work at a utilization factor that is no less than that of the PAC solutions.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.

Geometrically simple linear weirs using circular quadrants

A detailed theoretical analysis of flow through a quadrant plate weir is made in the light of the generalized theory of proportional weirs, using a numerical optimization procedure. It is shown that the flow through the quadrant plate weir has a linear discharge-head relationship valid for certain ranges of head. It is shown that the weir is associated with a reference plane or datum from which all heads are reckoned.Further, it is shown that the measuring range of the quadrant plate weir can be considerably enhanced by extending the tangents to the quadrants at the terminals of the quadrant plate weir. The importance of this weir (when the datum of the weir lies below its crest) as an outlet weir for grit chambers is highlighted. Experiments show excellent agreement with the theory by giving a constant average coefficient of discharge.

Test Application Time Minimization for RAS using Basis Optimization of Column Decoder

Random Access Scan, which addresses individual flip-flops in a design using a memory array like row and column decoder architecture, has recently attracted widespread attention, due to its potential for lower test application time, test data volume and test power dissipation when compared to traditional Serial Scan. This is because typically only a very limited number of random ``care'' bits in a test response need be modified to create the next test vector. Unlike traditional scan, most flip-flops need not be updated. Test application efficiency can be further improved by organizing the access by word instead of by bit. In this paper we present a new decoder structure that takes advantage of basis vectors and linear algebra to further significantly optimize test application in RAS by performing the write operations on multiple bits consecutively. Simulations performed on benchmark circuits show an average of 2-3 times speed up in test write time compared to conventional RAS.

Non-Linear effects of membrane fluctuations in the dilute lamellar phase

The static structure factor of the dilute sterically stabilised lamellar phase is calculated and found to have an Ornstein-Zernike form with a correlation length that diverges at infinite dilution. The relaxation time for concentration fluctuations at large wave number q is shown to go as q-3 with a coefficient independent of the membrane bending rigidity. The membrane fluctuations also give rise to strongly frequency-dependent viscosities at high frequencies.

Adaptive optimization of continuous bioreactor using neural network model

An adaptive optimization algorithm using backpropogation neural network model for dynamic identification is developed. The algorithm is applied to maximize the cellular productivity of a continuous culture of baker's yeast. The robustness of the algorithm is demonstrated in determining and maintaining the optimal dilution rate of the continuous bioreactor in presence of disturbances in environmental conditions and microbial culture characteristics. The simulation results show that a significant reduction in time required to reach optimal operating levels can be achieved using neural network model compared with the traditional dynamic linear input-output model. The extension of the algorithm for multivariable adaptive optimization of continuous bioreactor is briefly discussed.

Linear and nonlinear optical properties of cumulenes and polyenynes: a model exact study

Model exact static and frequency-dependent polarizabilities, static second hyperpolarizabilities and THG coefficents of cumulenes and polyenynes, calculated within the correlated Pariser-Parr-Pople (PPP) model defined over the pi-framework are reported and compared with the results for the polyenes. It is found that for the same chain length, the polarizabilities and THG coefficients of the cumulenes are largest and those of the polyenynes smallest with the polyenes having an intermediate value. The optical gap of the infinite cumulene is lowest (0.75 eV) and is associated with a low transition dipole moment for an excitation involving transfer of an electron between the two orthogonal conjugated pi-systems. The polyenynes have the largest optical gap (4.37 eV), with the magnitude being nearly independent of the chain length. This excitation involves charge transfer between the conjugated bonds in the terminal triple bond. Chain length and frequency dependence of alpha(ij) and gamma(ijkl) of these systems are also reported. The effect of a heteroatom on the polarizability and THG coefficients of acetylenic systems is also reported. It has been found that the presence of the heteroatom reduces the polarizability and THG coefficients of these systems, an effect opposite to that found in the polyenes and cyanine dyes. This result has been associated with the different nature of the charge transfer in the acetylenic systems.

Lazy structure sharing for query optimization

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

Unsteady axisymmetric stagnation-point flow of a viscous fluid on a cylinder

The unsteady viscous flow in the vicinity of an axisymmetric stagnation point of an infinite circular cylinder is investigated when both the free stream velocity and the velocity of the cylinder vary arbitrarily with time. The cylinder moves either in the same direction as that of the free stream or in the opposite direction. The flow is initially (t = 0) steady and then at t > 0 it becomes unsteady. The semi-similar solution of the unsteady Navier-Stokes equations has been obtained numerically using an implicit finite-difference scheme. Also the self-similar solution of the Navier-Stokes equations is obtained when the velocity of the cylinder and the free stream velocity vary inversely as a linear function of time. For small Reynolds number, a closed form solution is obtained. When the Reynolds number tends to infinity, the Navier-Stokes equations reduce to those of the two-dimensional stagnation-point flow. The shear stresses corresponding to stationary and the moving cylinder increase with the Reynolds number. The shear stresses increase with time for the accelerating flow but decrease with increasing time for the decelerating flow. For the decelerating case flow reversal occurs in the velocity profiles after a certain instant of time. (C) 1999 Elsevier Science Ltd. All rights reserved.

Quadratic Lyapunov functions for linear systems Journal

The paper deals with the existence of a quadratic Lyapunov function V = x′P(t)x for an exponentially stable linear system with varying coefficients described by the vector differential equation S0305004100044777_inline1 The derivative dV/dt is allowed to be strictly semi-(F) and the locus dV/dt = 0 does not contain any arc of the system trajectory. It is then shown that the coefficient matrix A(t) of the exponentially stable sy

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.

A Comparative Study of the Formulations for Topology Optimization of Compliant Mechanisms

The topology optimization problem for the synthesis of compliant mechanisms has been formulated in many different ways in the last 15 years, but there is not yet a definitive formulation that is universally accepted. Furthermore, there are two unresolved issues in this problem. In this paper, we present a comparative study of five distinctly different formulations that are reported in the literature. Three benchmark examples are solved with these formulations using the same input and output specifications and the same numerical optimization algorithm. A total of 35 different synthesis examples are implemented. The examples are limited to desired instantaneous output direction for prescribed input force direction. Hence, this study is limited to linear elastic modeling with small deformations. Two design parameterizations, namely, the frame element based ground structure and the density approach using continuum elements, are used. The obtained designs are evaluated with all other objective functions and are compared with each other. The checkerboard patterns, point flexures, the ability to converge from an unbiased uniform initial guess, and the computation time are analyzed. Some observations are noted based on the extensive implementation done in this study. Complete details of the benchmark problems and the results are included. The computer codes related to this study are made available on the internet for ready access.

Groundwater Management in India:Physical, Institutional and Policy Alternatives

Groundwater constitutes a vital natural resource for sustaining India’s agricultural economy and meeting the country’s social, ecological and environmental goals. It is a unique resource, widely available, providing security against droughts and yet it is closely linked to surface-water resources and the hydrological cycle. Its availability depends on geo-hydrological conditions and characteristics of aquifers, from deep to alluvium, sediment crystalline rocks to basalt formations; and agro-climate from humid to subhumid and semi-arid to arid. Its reliable supply, uniform quality and temperature, relative turbidity, pollution-safe, minimal evaporation losses, and low cost of development are attributes making groundwater more attractive compared to other resources. It plays a key role in the provision of safe drinking water to rural populations. For example, already almost 80% of domestic water use in rural areas in India is groundwater-supplied, and much of it is being supplied to farms, villages and small towns. Inadequate control of the use of groundwater, indiscriminate application of agrochemicals and unrestrained pollution of the rural environment by other human activities make groundwater usage unsustainable, necessitating proper management in the face of the twin demand for water of good quality for domestic supply and adequate supply for irrigation, ensuring equity, efficiency and sustainability of the resource. Groundwater irrigation has overtaken surface irrigation in the early 1980s, supported by well energization. It is estimated that there are about 24 million energised wells and tube wells now and it is driven by demand rather than availability, evident through the greater occurrence of wells in districts with high population densities. Apart from aquifer characteristics, land fragmentation and landholding size are the factors that decide the density of wells. The ‘rise and fall’ of local economies dependent on groundwater can be summarized as: the green revolution of 1980s, groundwaterbased agrarian boom, early symptoms of groundwater overdraft, and decline of the groundwater socio-ecology. The social characteristics and policy interventions typical of each stage provide a fascinating insight into the human-resource dynamics. This book is a compilation of nine research papers discussing various aspects of groundwater management. It attempts to integrate knowledge about the physical system, the socio-economic system, the institutional set-up and the policy environment to come out with a more realistic analysis of the situation with regard to the nature, characteristics and intensity of resource use, the size of the economy the use generates, and the negative socioeconomic consequences. Complex variables addressed in this regard focusing on northern Gujarat are the stock of groundwater available in the region, its hydrodynamics, its net outflows against inflows, the economics of its intensive use (particularly irrigation in semi-arid and arid regions), its criticality in the regional hydroecological regime, ethical aspects and social aspects of its use. The first chapter by Dinesh Kumar and Singh, dwells on complex groundwater socio-ecology of India, while emphasizing the need for policy measures to address indiscriminate over-exploitation of dwindling resources. The chapter also explores the nature of groundwater economy and the role of electricity prices on it. The next chapter on groundwater issue in north Gujarat provides a description of groundwater resource characteristics followed by a detailed analysis of the groundwater depletion and quality deterioration problems in the region and their undesirable consequences on the economy, ecosystem health and the society. Considering water-buyers and wellowning farmers individually, a methodology for economic valuation of groundwater in regions where its primary usage is in agriculture, and as assessment of the groundwater economy based on case studies from north Gujarat is presented in the fourth chapter. The next chapter focuses on the extent of dependency of milk production on groundwater, which includes the water embedded in green and dry fodder and animal feed. The study made a realistic estimate of irrigation water productivity in terms of the physics and economics of milk production. The sixth chapter analyses the extent of reduction in water usage, increase in yield and overall increase in physical productivity of alfalfa with the use of the drip irrigation system. The chapter also provides a detailed synthesis of the costs and benefits associated with the use of drip irrigation systems. A linear programmingbased optimization model with the objective to minimize groundwater use taking into account the interaction between two distinct components – farming and dairying under the constraints of food security and income stability for different scenarios, including shift in cropping pattern, introduction of water-efficient crops, water- saving technologies in addition to the ‘business as usual’ scenario is presented in the seventh chapter. The results show that sustaining dairy production in the region with reduced groundwater draft requires crop shifts and adoption of water-saving technologies. The eighth chapter provides evidences to prove that the presence of adequate economic incentive would encourage farmers to adopt water-saving irrigation devices, based on the findings of market research with reference to the level of awareness among farmers of technologies and the factors that decide the adoption of water-saving technologies. However, now the marginal cost of using electricity for agricultural pumping is almost zero. The economic incentives are strong and visible only when the farmers are either water-buyers or have to manage irrigation with limited water from tube-well partnerships. The ninth chapter explores the socio-economic viability of increasing the power tariff and inducing groundwater rationing as a tool for managing energy and groundwater demand, considering the current estimate of the country’s annual economic loss of Rs 320 billion towards electricity subsidy in the farm sector. The tenth chapter suggests private tradable property rights and development of water markets as the institutional tool for achieving equity, efficiency and sustainability of groundwater use. It identifies the externalities for local groundwater management and emphasizes the need for managing groundwater by local user groups, supported by a thorough analysis of groundwater socio-ecology in India. An institutional framework for managing the resource based on participatory approach that is capable of internalizing the externalities, comprising implementation of institutional and technical alternatives for resource management is also presented. Major findings of the analyses and key arguments in each chapter are summarized in the concluding chapter. Case studies of the social and economic benefits of groundwater use, where that use could be described as unsustainable, are interesting. The benefits of groundwater use are outlined and described with examples of social and economic impacts of groundwater and the negative aspects of groundwater development with the compilation of environmental problems based on up-to-date research results. This publication with a well-edited compilation of case studies is informative and constitutes a useful publication for students and professionals.