Alleviating supplier’s capital restriction by two-order arrangement

Consider a manufacturer that offers an advance payment to pre-order a quantity that must be satisfied by the production of a supplier before actual demand arises, and can order more after demand arises. We study the effectiveness of such two-order arrangement in alleviating the supplier’s capital restriction on channel performance.     

Multiplicity one theorems,S-version

It is well known by the strong multiplicity one thatπis uniquely determined by the Satake parameter c(π,v)for almost all v.Also,it suffices for us to test only finitely many v.We proved some S-effective version of multiplicity one theorems.Roughly speaking,ifπandπ′are not equivalent,then there is also a bound N(S)which is some expression in terms of K,d and max(N(π),N(π′)),which are analytic conductor ofπandπ′,respectively(will be defined soon),such that there is a v/∈S withπv～=π′vand N pvN.We also proved S-effective multiplicity one for the Chebotarev Density Theorem,and for GL(1).     

How should process capabilities be combined to leverage supplier relationships competitively?

Two process capabilities have been identified in the operations management literature to leverage supplier relationships for competitive performance: the ability to continuously improve processes with suppliers (process alignment) and the ability to make changes to these relationships (partnering flexibility). While firms may need both capabilities to be successful, it is unclear what strategy should be used to combine these two seemingly contradictory process capabilities. Using data collected from 318 manufacturing firms on a focal firm’s process capabilities to manage supplier relationships, we examine the performance impacts of two dimensions of a particular strategy: balancing (focusing on achieving a close match between the two process capabilities) and complementing (focusing on creating synergy between the two process capabilities). Our results indicate that the balancing dimension has a much stronger effect on a firm’s competitive performance than the complementing dimension. Also, when a firm pursues a high balance and strong complements strategy (combining high levels of both process capabilities), it is able to reduce its competitive performance risks more than when it pursues a high balance and weak complements strategy (combining low levels of both capabilities) or when it implements unbalanced strategies that emphasize either process alignment or partnering flexibility (combining low levels of one capability with high levels of the other). We conclude by discussing the theoretical contributions and practical guidelines.     

A Note for one of Inequality

In this paper, we find the largest contant C such that sin2 x xtanx > 2x2 cx5tan x 0相似文献   

Value of supplier’s capacity information in a two-echelon supply chain

In traditional supply chain models it is generally assumed that full information is available to all parties involved. Although this seems reasonable, there are cases where chain members are independent agents and possess different levels of information. In this study, we analyze a two-echelon, single supplier-multiple retailers supply chain in a single-period setting where the capacity of the supplier is limited. Embedding the lack of information about the capacity of the supplier in the model, we aim to analyze the reaction of the retailers, compare it with the full-information case, and assess the value of information and the effects of information asymmetry using game theoretic analysis. In our numerical studies, we conclude that the value of information is highly dependent on the capacity conditions and estimates of the retailers, and having information is not necessarily beneficial to the retailers.     

Hodge integrals with one λ-class

Hodge integrals over moduli space of stable curves play an important roles in understanding the topological properties of moduli space.ELSV formula connects the Hodge integrals with Hurwitz numbers,and the generating function of Hurwitz numbers satisfies the cut-and-join equation.Therefore,it is natural to consider how to use the cut-and-join equation for Hurwitz numbers to compute Hodge integrals which appear in ELSV formula.In this paper,at first,we will review the method introduced in Goulden et al.’s paper to get the λ g conjecture for Hodge integral.Through some variables transformation,the generating function of Hurwitz number becomes a symmetric polynomial which satisfies a symmetrized cut-and-join equation.By comparing the coefficients of the lowest degree term of both sides in this equation,we can get the λ g conjecture.Then,in a similar way,we obtain our main result in this paper:a recursive formula for Hodge integral of type contains only one λ g 1-class.We also point out that our results are closely related to the degree 0 Virasoro conjecture for a curve.     

Establishing Nash equilibrium of the manufacturer–supplier game in supply chain management

We study a game model of multi-leader and one-follower in supply chain optimization where n suppliers compete to provide a single product for a manufacturer. We regard the selling price of each supplier as a pre-determined parameter and consider the case that suppliers compete on the basis of delivery frequency to the manufacturer. Each supplier's profit depends not only on its own delivery frequency, but also on other suppliers' frequencies through their impact on manufacturer's purchase allocation to the suppliers. We first solve the follower's (manufacturer's) purchase allocation problem by deducing an explicit formula of its solution. We then formulate the n leaders' (suppliers') game as a generalized Nash game with shared constraints, which is theoretically difficult, but in our case could be solved numerically by converting to a regular variational inequality problem. For the special case that the selling prices of all suppliers are identical, we provide a sufficient and necessary condition for the existence and uniqueness of the Nash equilibrium. An explicit formula of the Nash equilibrium is obtained and its local uniqueness property is proved.     

Cohomogeneity one Kähler and Kähler–Einstein manifolds with one singular orbit I

Let M be a cohomogeneity one manifold of a compact semisimple Lie group G with one singular orbit \(S_0 = G/H\). Then M is G-diffeomorphic to the total space \(G \times _H V\) of the homogeneous vector bundle over \(S_0\) defined by a sphere transitive representation of G in a vector space V. We describe all such manifolds M which admit an invariant Kähler structure of standard type. This means that the restriction \(\mu : S = Gx = G/L \rightarrow F = G/K \) of the moment map of M to a regular orbit \(S=G/L\) is a holomorphic map of S with the induced CR structure onto a flag manifold \(F = G/K\), where \(K = N_G(L)\), endowed with an invariant complex structure \(J^F\). We describe all such standard Kähler cohomogeneity one manifolds in terms of the painted Dynkin diagram associated with \((F = G/K,J^F)\) and a parameterized interval in some T-Weyl chamber. We determine which of these manifolds admit invariant Kähler–Einstein metrics.     

Impact of channel power and fairness concern on supplier’s market entry decision

In a two-stage supply chain comprising a supplier and a retailer, we incorporate the concepts of channel power and fairness concern to analyze the supplier’s decision on whether to open an online direct channel or not. With an online channel, the supplier competes with its retailer in a dual-channel system, but the retailer may shift part or all orders to another supplier as the counteraction. Otherwise, the supplier only obtains the wholesaling profit but loses that from the online market. Taking the retail prices and the quality of the online product as decision variables, we show that the introduction of a direct channel leads to the decline of online product’s quality and retail price. Interestingly, we find that the retailer’s profit may be decreasing in its channel power. Comparing the outcomes with those from pure competing channels, we find that the retailer’s order shifting strategy may result in a lose–lose situation for the two firms, but it can be a credible threat to the supplier’s market entry. We also find that the supplier’s fairness concern may effectively reduce its incentives to open an online channel.     

Zero—one programming with multiple criteria

The study of multiple criteria problems is not new, but during the last seventeen years more and more study has been done in this area. The study of 0–1 multiple criteria problems started much later than the study of continuous multiple criteria problems. Some of the earliest works on 0–1 problems with multiple criteria was first presented in 1973. Quite a few solution methods have been developed since then, especially during the last seven years. In this paper most of these methods and some applications will be treated.     

Operational complexity and supplier–customer integration: case study insights and complexity rebound

The main contribution of this paper is the demonstration that, contrary to conventional thinking, a measurable increase in the operational complexity of the production scheduling function between two companies can occur following closer supply chain integration. The paper presents the practical application of previous work carried out and validated by the authors in terms of (a) methodology for measuring operational complexity, (b) predicted implications of Supplier–Customer integration and (c) derivation of an operational complexity measure applied to before and after Supplier–Customer integration. This application is illustrated via a longitudinal case study. The analysis is based on information theory, whereby operational complexity of a Supplier–Customer system is defined as the amount of information required to describe the state of this system. The results show that operational complexity can increase when companies decide to integrate more closely, which is a fact likely to be overlooked when making decisions to pursue closer Supply-Chain integration. In this study, operational complexity increases due to reduced buffering arising from reduction in the Supplier's inventory capacity. The Customer did not change their operational practices to improve their schedule adherence post-integration, and, consequently, suffered an increase in complexity due to complexity rebound. Both the Supplier's and Customer's decision-making processes after the case study reported in this paper were enhanced by being able to quantify the complex areas to prioritise and direct managerial efforts towards them, through the use of the operational complexity measure. Future work could extend this study (in the ‘low product customisation’ and ‘low product value impact’ quadrant) to investigate Supplier–Customer integration in other quadrants resulting from further combinations between ‘product customisation’ and ‘product value impact’ levels.     

Optimal business policies for a supplier–transporter–buyer channel with a price-sensitive demand

As the third party logistics partners (carriers) taking a more and more significant role in supply chain practices and customer service performance improvement, there is an emerging need for the studies on optimal channel coordination policies for business processes involving not only supplier and buyer (retailer), but also transportation partners. In this paper, we explicitly add a transportation partner with concave cost functions into the analysis for supplier–buyer channel coordination policies, and analyse the impact of coordination and pricing policies on supply chain profitability. The market demand is assumed to be a decreasing convex function of buyer's selling price (x), D(x)=d/x². Under this assumption, we quantify the improvement on total supply chain profitability when moving from a non-cooperative environment to a fully cooperative environment, and show that the joint annual profit of three partners in a cooperative environment can be at least twice of what may be achieved by three independently operated companies in a leader–follower business game. While in a real-world business environment, a perfect collaboration is hard to achieve, this result can be used to provide a quick estimation on the upper bound on the budget for profit sharing or discount offers among the supply chain partners.     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings     

Surrogate-RLT cuts for zero–one integer programs

In this paper, we consider the class of 0–1 integer problems and develop an effective cutting plane algorithm that gives valid inequalities called surrogate-RLT cuts (SR cuts). Here we implement the surrogate constraint analysis along with the reformulation–linearization technique (RLT) to generate strong valid inequalities. In this approach, we construct a tighter linear relaxation by augmenting SR cuts to the problem. The level-\(d\) SR closure of a 0–1 integer program is the polyhedron obtained by intersecting all the SR cuts obtained from RLT polyhedron formed over each set of \(d\) variables with its initial formulation. We present an algorithm for approximately optimizing over the SR closure. Finally, we present the computational result of SR cuts for solving 0–1 integer programming problems of well-known benchmark instances from MIPLIB 3.0.     

Using entropy for quantitative measurement of operational complexity of supplier–customer system: case studies

The paper concerns with analysis of operational complexity of company supplier–customer relations. Well-known approach for measuring of operational complexity is based upon entropy. However, there are several approaches thereon. In the first part, we discuss various general measures of uncertainty of states, the power entropies in particular. In the second part, we use Shannon entropy as a base framework for our two case studies—the first, a supplier–customer system which implements managerial thresholds for processing product delivery term deviations, the second, a supplier system of the most important commodity in brewery industry, the malted barley. In both cases, we assume an existence of problem-oriented databases, which contain detailed records of all product orders, deliveries and forecasts in quantity and time having been scheduled and realized. Our general procedure elaborated consists of three basic steps—pre-processing of data with consistency checks in Java, calculation of histograms and empirical distribution functions, and finally, evaluation of conditional entropy. The last two steps are realized by Mathematica modules. Illustrative results of operational complexity measurement using entropy are provided for both case studies.     

Wavelet–Galerkin solutions of one dimensional elliptic problems

Daubechies wavelet bases are used for numerical solution of partial differential equations of one dimension by Galerkin method. Galerkin bases are constructed from Daubechies functions which are compactly supported and which constitute an orthonormal basis of L²(R)$L^2(\mathbb{R})$. Theoretical and numerical results are obtained for elliptic problems of second order with different types of boundary conditions. Optimal error estimates are also obtained. Comparison of solutions with simple finite difference method suggests that for this class of problems, the present method will provide a better alternative to other classical methods. The methodology can be generalized to multidimensional problems by taking care of some technical facts.     

When does gradient Ricci soliton have one end?

Annals of Global Analysis and Geometry - In this paper, we study a problem of finding compact hypersurfaces of prescribed mean curvature with free boundary in a ball. We transform the problem to an...     

Linear multiple objective programs with zero–one variables

Theoretical results are developed for zero–one linear multiple objective programs. Initially a simpler program, having as a feasible set the vertices of the unit hypercube, is studied. For the main problem an algorithm, computational experience, parametric analysis and indifference sets are presented. The mixed integer version of the main problem is briefly discussed.This research was partially supported by the Fundação Carlos Alberto Vanzolini.     

The Gröbner ring conjecture in one variable

We prove that a valuation domain V has Krull dimension ≤ 1 if and only if for every finitely generated ideal I of V[X] the ideal generated by the leading terms of elements of I is also finitely generated. This proves the Gröbner ring conjecture in one variable. The proof we give is both simple and constructive. The same result is valid for semihereditary rings.