Design of optimal one-bit adder networks by integer linear programming /

"July 15, 1971."

A model for linear programming optimization of I/O-bound programs /

"June, 1969."

A code for zero-one integer linear programming by implicit enumeration, a programming manual for ILLIP.

Issued also as thesis (M.S.) University of Illinois.

Anisotropy-based robust performance analysis of finite horizon linear discrete time varying systems

We consider a problem of robust performance analysis of linear discrete time varying systems on a bounded time interval. The system is represented in the state-space form. It is driven by a random input disturbance with imprecisely known probability distribution; this distributional uncertainty is described in terms of entropy. The worst-case performance of the system is quantified by its a-anisotropic norm. Computing the anisotropic norm is reduced to solving a set of difference Riccati and Lyapunov equations and a special form equation.

Optimization of physical distribution problem in logistics management

Physical distribution plays an imporant role in contemporary logistics management. Both satisfaction level of of customer and competitiveness of company can be enhanced if the distribution problem is solved optimally. The multi-depot vehicle routing problem (MDVRP) belongs to a practical logistics distribution problem, which consists of three critical issues: customer assignment, customer routing, and vehicle sequencing. According to the literatures, the solution approaches for the MDVRP are not satisfactory because some unrealistic assumptions were made on the first sub-problem of the MDVRP, ot the customer assignment problem. To refine the approaches, the focus of this paper is confined to this problem only. This paper formulates the customer assignment problem as a minimax-type integer linear programming model with the objective of minimizing the cycle time of the depots where setup times are explicitly considered. Since the model is proven to be MP-complete, a genetic algorithm is developed for solving the problem. The efficiency and effectiveness of the genetic algorithm are illustrated by a numerical example.

Optimization of a 42.7 Gb/s wavelength tunable RZ transmitter using a linear spectrogram technique

The optimization of a wavelength tunable RZ transmitter, consisting of an electro-absorption modulator and a SG DBR tunable laser, is carried out using a linear spectrogram based characterization and leads to 1500 km transmission at 42.7 Gb/s independent of the operating wavelength. We demonstrate that, to ensure optimum and consistent transmission performance over a portion of the C-band, the RF drive and bias conditions of the EAM must be varied at each wavelength. The sign and magnitude of the pulse chirp (characterized using the linear spectrographic technique) is therefore tailored to suit the dispersion map of the transmission link. Results achieved show that by optimizing the drive and DC bias applied to the EAM, consistent transmission performance can be achieved over a wide wavelength range. Failure to optimize the EAM drive conditions at each wavelength can lead to serious degradation in system performance.

Multiple criteria optimization of contemporary logistics distribution network problems

In the contemporary customer-driven supply chain, maximization of customer service plays an equally important role as minimization of costs for a company to retain and increase its competitiveness. This article develops a multiple-criteria optimization approach, combining the analytic hierarchy process (AHP) and an integer linear programming (ILP) model, to aid the design of an optimal logistics distribution network. The proposed approach outperforms traditional cost-based optimization techniques because it considers both quantitative and qualitative factors and also aims at maximizing the benefits of deliverer and customers. In the approach, the AHP is used to determine the relative importance weightings or priorities of alternative warehouses with respect to some critical customer-oriented criteria. The results of AHP prioritization are utilized as the input of the ILP model, the objective of which is to select the best warehouses at the lowest possible cost. In this article, two commercial packages are used: including Expert Choice and LINDO.

Multicriteria Evaluation and Optimization of Hierarchical Systems

It is shown that any multicriteria problem can be represented by a hierarchical system. Separate properties of the object are evaluated at the lower level of the system, using a criteria vector, and a composition mechanism is used to evaluate the object as a whole at the upper level. The paper proposes a method to solve complex multicriteria problems of evaluation and optimization. It is based on nested scalar convolutions of vector- valued criteria and allows simple structural and parametrical synthesis of multicriteria hierarchical systems.

Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

Method of Linear Programming as an Idea for High School Curriculum

2010 Mathematics Subject Classification: 97D40, 97M10, 97M40, 97N60, 97N80, 97R80

Optimization Problem in a Class of Linear System. Application to Multiple Drug Administration

2000 Mathematics Subject Classification: 62H15, 62P10.

A Kreps-Scheinkman-állítás érvényessége lineáris keresletű vegyes duopóliumok esetén (The Kreps and Scheinkman result remains valid for mixed duopolies with linear demand)

Vegyes oligopóliumoknak nevezzük az olyan piacszerkezeteket, amelyek esetében a magánvállalatok mellett állami vállalatok is tevékenykednek. A vegyes oligopóliumokban az állami vállalatok részben vagy egészében a társadalmi többletet kívánják maximalizálni. Olyan vegyes duopóliumot vizsgálunk, amelyben a vállalatok előbb kiépítik kapacitásaikat, majd meghatározzák termékük kínálati árát. Kreps-Scheinkman [1983] tisztán magánvállalatos duopóliumokra vizsgált ilyen két időszakos modellt, és megállapította, hogy az első időszaki egyensúlyi kapacitások megegyeznek az azonos költségszerkezetű és kínálati viszonyú Cournot-duopólium egyensúlyi kibocsátásaival. Tanulmányunkban Kreps-Scheinkman [1983] eredményét kiterjesztjük a vegyes duopóliumok - lineáris keresleti görbe és konstans egységköltségek melletti - esetére. _____ In mixed oligopolies, private firms compete with a public firm, which at least partially aims to maximize social surplus. The authors investigate mixed duopolies in which the firms first build capacities simultaneously and then set their prices simultaneously as well. For the same two-stage game with purely private firms Kreps and Scheinkman demonstrated in 1983 that the first-stage equilibrium capacities of the two-stage game are identical with the equilibrium outputs of the Cournot duopoly. This paper extends Kreps and Scheinkman's results to mixed duopolies with linear demands and constant unit costs. It is shown that quantity pre-commitment and Bertrand competition also yield to Cournot outcomes when a public firm is involved, not only in the case of private firms.

A non-linear discrete stochastic optimization model for Advanced Access patient appointment scheduling

Access to healthcare is a major problem in which patients are deprived of receiving timely admission to healthcare. Poor access has resulted in significant but avoidable healthcare cost, poor quality of healthcare, and deterioration in the general public health. Advanced Access is a simple and direct approach to appointment scheduling in which the majority of a clinic's appointments slots are kept open in order to provide access for immediate or same day healthcare needs and therefore, alleviate the problem of poor access the healthcare. This research formulates a non-linear discrete stochastic mathematical model of the Advanced Access appointment scheduling policy. The model objective is to maximize the expected profit of the clinic subject to constraints on minimum access to healthcare provided. Patient behavior is characterized with probabilities for no-show, balking, and related patient choices. Structural properties of the model are analyzed to determine whether Advanced Access patient scheduling is feasible. To solve the complex combinatorial optimization problem, a heuristic that combines greedy construction algorithm and neighborhood improvement search was developed. The model and the heuristic were used to evaluate the Advanced Access patient appointment policy compared to existing policies. Trade-off between profit and access to healthcare are established, and parameter analysis of input parameters was performed. The trade-off curve is a characteristic curve and was observed to be concave. This implies that there exists an access level at which at which the clinic can be operated at optimal profit that can be realized. The results also show that, in many scenarios by switching from existing scheduling policy to Advanced Access policy clinics can improve access without any decrease in profit. Further, the success of Advanced Access policy in providing improved access and/or profit depends on the expected value of demand, variation in demand, and the ratio of demand for same day and advanced appointments. The contributions of the dissertation are a model of Advanced Access patient scheduling, a heuristic to solve the model, and the use of the model to understand the scheduling policy trade-offs which healthcare clinic managers must make. ^

Optimization of waiting time at toll plazas

Toll plazas have several toll payment types such as manual, automatic coin machines, electronic and mixed lanes. In places with high traffic flow, the presence of toll plaza causes a lot of traffic congestion; this creates a bottleneck for the traffic flow, unless the correct mix of payment types is in operation. The objective of this research is to determine the optimal lane configuration for the mix of the methods of payment so that the waiting time in the queue at the toll plaza is minimized. A queuing model representing the toll plaza system and a nonlinear integer program have been developed to determine the optimal mix. The numerical results show that the waiting time can be decreased at the toll plaza by changing the lane configuration. For the case study developed an improvement in the waiting time as high as 96.37 percent was noticed during the morning peak hour.

Modelo para distribuição de recursos nos municípios brasileiros baseado na lei de diretrizes orçamentárias, análise multicritério e programação linear

The municipal management in any country of the globe requires planning and allocation of resources evenly. In Brazil, the Law of Budgetary Guidelines (LDO) guides municipal managers toward that balance. This research develops a model that seeks to find the balance of the allocation of public resources in Brazilian municipalities, considering the LDO as a parameter. For this using statistical techniques and multicriteria analysis as a first step in order to define allocation strategies, based on the technical aspects arising from the municipal manager. In a second step, presented in linear programming based optimization where the objective function is derived from the preference of the results of the manager and his staff. The statistical representation is presented to support multicriteria development in the definition of replacement rates through time series. The multicriteria analysis was structured by defining the criteria, alternatives and the application of UTASTAR methods to calculate replacement rates. After these initial settings, an application of linear programming was developed to find the optimal allocation of enforcement resources of the municipal budget. Data from the budget of a municipality in southwestern Paraná were studied in the application of the model and analysis of results.