Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints

* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.

Explicit Solutions of Nonlocal Boundary Value Problems, Containing Bitsadze-Samarskii Constraints

MSC 2010: 44A35, 35L20, 35J05, 35J25

Optimality Conditions for D.C. Vector Optimization Problems under D.C. Constraints

2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.

Control Systems with Constraints and Uncertain Initial Conditions

AMS subject classification: 49N55, 93B52, 93C15, 93C10, 26E25.

First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints

2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52.

Non-stationary stochastic inventory lot-sizing with emission and service level constraints in a carbon cap-and-trade system

Firms worldwide are taking major initiatives to reduce the carbon footprint of their supply chains in response to the growing governmental and consumer pressures. In real life, these supply chains face stochastic and non-stationary demand but most of the studies on inventory lot-sizing problem with emission concerns consider deterministic demand. In this paper, we study the inventory lot-sizing problem under non-stationary stochastic demand condition with emission and cycle service level constraints considering carbon cap-and-trade regulatory mechanism. Using a mixed integer linear programming model, this paper aims to investigate the effects of emission parameters, product- and system-related features on the supply chain performance through extensive computational experiments to cover general type business settings and not a specific scenario. Results show that cycle service level and demand coefficient of variation have significant impacts on total cost and emission irrespective of level of demand variability while the impact of product's demand pattern is significant only at lower level of demand variability. Finally, results also show that increasing value of carbon price reduces total cost, total emission and total inventory and the scope of emission reduction by increasing carbon price is greater at higher levels of cycle service level and demand coefficient of variation. The analysis of results helps supply chain managers to take right decision in different demand and service level situations.

Financial constraints and technical efficiency:some empirical evidence for Italian producers' cooperatives

In this paper, we test the extent to which producers' cooperatives can experience an increase in technical efficiency following a tightening of financial constraints. This hypothesis is tested on a sample of Italian conventional and cooperative firms for the wine production and processing sector, using frontier analysis. The results support the hypothesis that increasing financial pressure can affect positively the cooperatives efficiency. Journal compilation © CIRIEC 2010.

Semi-supervised Gaussian process latent variable model with pairwise constraints

In machine learning, Gaussian process latent variable model (GP-LVM) has been extensively applied in the field of unsupervised dimensionality reduction. When some supervised information, e.g., pairwise constraints or labels of the data, is available, the traditional GP-LVM cannot directly utilize such supervised information to improve the performance of dimensionality reduction. In this case, it is necessary to modify the traditional GP-LVM to make it capable of handing the supervised or semi-supervised learning tasks. For this purpose, we propose a new semi-supervised GP-LVM framework under the pairwise constraints. Through transferring the pairwise constraints in the observed space to the latent space, the constrained priori information on the latent variables can be obtained. Under this constrained priori, the latent variables are optimized by the maximum a posteriori (MAP) algorithm. The effectiveness of the proposed algorithm is demonstrated with experiments on a variety of data sets. © 2010 Elsevier B.V.

Optimal redistricting under geographical constraints: Why "pack and crack" does not work

We show that optimal partisan redistricting with geographical constraints is a computationally intractable (NP-complete) problem. In particular, even when voter's preferences are deterministic, a solution is generally not obtained by concentrating opponent's supporters in \unwinnable" districts ("packing") and spreading one's own supporters evenly among the other districts in order to produce many slight marginal wins ("cracking").

Vertikális korlátozások - növelik vagy csökkentik a jólétet? Érvek az irodalomból = Vertical constraints - do they increase or reduce welfare? Arguments in the literature

A vertikális korlátozások témaköre a versenypolitika és -szabályozás egyik legfontosabb, de mindenképpen legtöbb vitát generáló területe. A téma magyar irodalma elsősorban elméleti kérdésekkel foglalkozik, mellőzve a konkrét iránymutatásokat a probléma kezelésére. Először röviden bemutatjuk a vertikális korlátozások indokait és hatásmechanizmusát magyarázó teoretikus irodalmat, felsorolva azok hatékonyságnövelő hatását hangsúlyozó érvrendszereket, illetve a versenykorlátozás lehetőségét tárgyaló modelleket is. Ezután bemutatjuk, hogy milyen fontos empirikus vizsgálatokat végeztek ezen elméletek vizsgálatára, és milyen következtetések vonhatóak le a tapasztalatokból. _________ The field of vertical constraints is one of the most important in competition policy and regulation, but one that generates the most debate. Hungarian literature on the subject deals primarily with theoretical questions, refraining from offering specific guidelines for handling the problem. The paper first covers briefly the causes of the vertical constraints and the Hungarian theoretical literature on its effective mechanism, listing the system of arguments that point to its effect of increasing efficiency and the models that discuss the possibility of limiting competition. The paper then presents the major empirical examinations made of these theories and the conclusions drawn from that experience.

Páros összehasonlításon alapuló pontozási eljárások monotonitása: önkonzisztencia és önkonzisztens monotonitás. Adalékok a pontozási eljárások axiomatikus tárgyalásához = Monotonicity of paired comparison-based ranking methods: self-consistency and self-consistent monotonicity. Contributions to an axiomatic analysis of scoring methods

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat tárgyalja axiomatikus megközelítésben. A szakirodalomban számos értékelő függvényt javasoltak erre a célra, néhány karakterizációs eredmény is ismert. Ennek ellenére a megfelelő módszer kiválasztása nem egy-szerű feladat, a különböző tulajdonságok bevezetése elsősorban ebben nyújthat segítséget. Itt az összehasonlított objektumok teljesítményén érvényesülő monotonitást tárgyaljuk az önkonzisztencia és önkonzisztens monotonitás axiómákból kiindulva. Bemutatásra kerülnek lehetséges gyengítéseik és kiterjesztéseik, illetve egy, az irreleváns összehasonlításoktól való függetlenséggel kapcsolatos lehetetlenségi tétel is. A tulajdonságok teljesülését három eljárásra, a klasszikus pontszám eljárásra, az ezt továbbfejlesztő általánosított sorösszegre és a legkisebb négyzetek módszerére vizsgáljuk meg, melyek mindegyike egy lineáris egyenletrendszer megoldásaként számítható. A kapott eredmények új szempontokkal gazdagítják a pontozási eljárás megválasztásának kérdését. _____ The paper provides an axiomatic analysis of some scoring procedures based on paired comparisons. Several methods have been proposed for these generalized tournaments, some of them have been also characterized by a set of properties. The choice of an appropriate method is supported by a discussion of their theoretical properties. In the paper we focus on the connections of self-consistency and self-consistent-monotonicity, two axioms based on the comparisons of object's performance. The contradiction of self-consistency and independence of irrel-evant matches is revealed, as well as some possible reductions and extensions of these properties. Their satisfiability is examined through three scoring procedures, the score, generalised row sum and least squares methods, each of them is calculated as a solution of a system of linear equations. Our results contribute to the problem of finding a proper paired comparison based scoring method.

Properties of risk capital allocation methods: Core Compatibility, Equal Treatment Property and Strong Monotonicity

In finance risk capital allocation raises important questions both from theoretical and practical points of view. How to share risk of a portfolio among its subportfolios? How to reserve capital in order to hedge existing risk and how to assign this to different business units? We use an axiomatic approach to examine risk capital allocation, that is we call for fundamental properties of the methods. Our starting point is Csóka and Pintér (2011) who show by generalizing Young (1985)'s axiomatization of the Shapley value that the requirements of Core Compatibility, Equal Treatment Property and Strong Monotonicity are irreconcilable given that risk is quantified by a coherent measure of risk. In this paper we look at these requirements using analytic and simulations tools. We examine allocation methods used in practice and also ones which are theoretically interesting. Our main result is that the problem raised by Csóka and Pintér (2011) is indeed relevant in practical applications, that is it is not only a theoretical problem. We also believe that through the characterizations of the examined methods our paper can serve as a useful guide for practitioners.

Hedging under liquidity constraints

Although risk management can be justified by financial distress, the theoretical models usually contain hedging instruments free of funding risk. In practice, management of the counterparty risk in derivative transactions is of enhanced importance, consequently not only is trading on exchanges subject to the presence of a margin account, but also in bilateral (OTC) agreements parties will require margins or collateral from their partners in order to hedge the mark-tomarket loss of the transaction. The aim of this paper is to present and compare two models where the financing need of the hedging instrument also appears, influencing the hedging strategy and the optimal hedging ratio. Both models contain the same source of risk and optimisation criterion, but the liquidity risk is modelled in different ways. In the first model, there is no additional financing resource that can be used to finance the margin account in case of a margin call, which entails the risk of liquidation of the hedging position. In the second model, the financing is available but a given credit spread is to be paid for this, so hedging can become costly.

Financial constraints on research and development

This dissertation examines whether-there exists financial constraints and, if so, their implications for investment in research and development expenditures. It develops a theoretical model of credit rationing and research and development in which both are determined simultaneously and endogenously. The model provides a useful tool to examine different policies that may help alleviate the negative the effect of financial constraints faced by firms.^ The empirical evidence presented deals with two different cases, namely, the motor vehicle industry in Germany (1970-1990) and the electrical machinery industry In Spain (1975-1990).^ The innovation in the empirical analysis is that it follows a novel approach to identify events that allow us to isolate the effect of financial constraints in the determination of research and development.^ Further, empirical evidence is presented to show that in the above two cases financial constraints affect investment in physical capital as well.^ The empirical evidence presented supports the results of the theoretical model developed in this dissertation, showing that financial constraints negatively affect the rate of growth of innovation by reducing the intensity of research and development activity. ^

A theory of constraints service systems improvement method: Case of the airline turnaround problem

This dissertation develops a process improvement method for service operations based on the Theory of Constraints (TOC), a management philosophy that has been shown to be effective in manufacturing for decreasing WIP and improving throughput. While TOC has enjoyed much attention and success in the manufacturing arena, its application to services in general has been limited. The contribution to industry and knowledge is a method for improving global performance measures based on TOC principles. The method proposed in this dissertation will be tested using discrete event simulation based on the scenario of the service factory of airline turnaround operations. To evaluate the method, a simulation model of aircraft turn operations of a U.S. based carrier was made and validated using actual data from airline operations. The model was then adjusted to reflect an application of the Theory of Constraints for determining how to deploy the scarce resource of ramp workers. The results indicate that, given slight modifications to TOC terminology and the development of a method for constraint identification, the Theory of Constraints can be applied with success to services. Bottlenecks in services must be defined as those processes for which the process rates and amount of work remaining are such that completing the process will not be possible without an increase in the process rate. The bottleneck ratio is used to determine to what degree a process is a constraint. Simulation results also suggest that redefining performance measures to reflect a global business perspective of reducing costs related to specific flights versus the operational local optimum approach of turning all aircraft quickly results in significant savings to the company. Savings to the annual operating costs of the airline were simulated to equal 30% of possible current expenses for misconnecting passengers with a modest increase in utilization of the workers through a more efficient heuristic of deploying them to the highest priority tasks. This dissertation contributes to the literature on service operations by describing a dynamic, adaptive dispatch approach to manage service factory operations similar to airline turnaround operations using the management philosophy of the Theory of Constraints.