Operationalizing Supply Chain vs. Supply Chain Competion

Competition is an immensely important area of study in economic theory, business and strategy. It is known to be vital in meeting consumers’ growing expectations, stimulating increase in the size of the market, pushing innovation, reducing cost and consequently generating better value for end users, among other things. Having said that, it is important to recognize that supply chains, as we know it, has changed the way companies deal with each other both in confrontational or conciliatory terms. As such, with the rise of global markets and outsourcing destinations, increased technological development in transportation, communication and telecommunications has meant that geographical barriers of distance with regards to competition are a thing of the past in an increasingly flat world. Even though the dominant articulation of competition within management and business literature rests mostly within economic competition theory, this thesis draws attention to the implicit shift in the recognition of other forms of competition in today’s business environment, especially those involving supply chain structures. Thus, there is popular agreement within a broad business arena that competition between companies is set to take place along their supply chains. Hence, management’s attention has been focused on how supply chains could become more aggressive making each firm in its supply chain more efficient. However, there is much disagreement on the mechanism through which such competition pitching supply chain against supply chain will take place. The purpose of this thesis therefore, is to develop and conceptualize the notion of supply chain vs. supply chain competition, within the discipline of supply chain management. The thesis proposes that competition between supply chains may be carried forward via the use of competition theories that emphasize interaction and dimensionality, hence, encountering friction from a number of sources in their search for critical resources and services. The thesis demonstrates how supply chain vs. supply chain competition may be carried out theoretically, using generated data for illustration, and practically using logistics centers as a way to provide a link between theory and corresponding practice of this evolving competition mode. The thesis concludes that supply chain vs. supply chain competition, no matter the conceptualization taken, is complex, novel and can be very easily distorted and abused. It therefore calls for the joint development of regulatory measures by practitioners and policymakers alike, to guide this developing mode of competition.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

A new classification and linear sequence of extant gymnosperms

A new classification and linear sequence of the gymnosperms based on previous molecular and morphological phylogenetic and other studies is presented. Currently accepted genera are listed for each family and arranged according to their (probable) phylogenetic position. A full synonymy is provided, and types are listed for accepted genera. An index to genera assists in easy access to synonymy and family placement of genera.

A linear sequence of extant families and genera of lycophytes and ferns

Throughout the history of the classification of extant ferns (monilophytes) and lycophytes, familial and generic concepts have been in great flux. For the organisation of lycophytes and ferns in herbaria, books, checklists, indices and spore banks and on the internet, this poses a problem, and a standardized linear sequence of these plants is therefore in great need. We provide here a linear classification to the extant lycophytes and ferns based on current phylogenetic knowledge; this provides a standardized guide for organisation of fern collections into a more natural sequence. Two new families, Diplaziopsidaceae and Rhachidosoraceae, are here introduced.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

Nonnegative integral solution of linear equations

A method to obtain a nonnegative integral solution of a system of linear equations, if such a solution exists is given. The method writes linear equations as an integer programming problem and then solves the problem using a combination of artificial basis technique and a method of integer forms.

An efficient algorithm for linear programming

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

Kinetics of sono-photooxidative degradation of poly(alkyl methacrylate)s

The mechano-chemical degradation of poly(methyl methacrylate) (PMMA), poly(ethyl methacrylate) (PEMA) and poly(n-butyl methacrylate) (PBMA) using ultrasound (US), ultraviolet (UV) radiation and a photoinitiator (benzoin) has been investigated. The degradation of the polymers was monitored using the reduction in number average molecular weight (M-n) and polydispersity (PDI). A degradation mechanism that included the decomposition of the initiator, generation of polymer radicals by the hydrogen abstraction of initiator radicals, reversible chain transfer between stable polymer and polymer radicals was proposed. The mechanism assumed mid-point chain scission due to US and random scission due to UV radiation. A series of experiments with different initial M-n of the polymers were performed and the results indicated that, irrespective of the initial PDI, the PDI during the sono-photooxidative degradation evolved to a steady state value of 1.6 +/- 0.05 for all the polymers. This steady state evolution of PDI was successfully predicted by the continuous distribution kinetics model. The rate coefficients of polymer scission due to US and UV exhibited a linear increase and decrease with the size of the alkyl group of the poly(alkyl methacrylate)s, respectively. (C) 2010 Elsevier B.V. All rights reserved.

An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

A simple and efficient algorithm for the bandwidth reduction of sparse symmetric matrices is proposed. It involves column-row permutations and is well-suited to map onto the linear array topology of the SIMD architectures. The efficiency of the algorithm is compared with the other existing algorithms. The interconnectivity and the memory requirement of the linear array are discussed and the complexity of its layout area is derived. The parallel version of the algorithm mapped onto the linear array is then introduced and is explained with the help of an example. The optimality of the parallel algorithm is proved by deriving the time complexities of the algorithm on a single processor and the linear array.

2-Dimensional Linear-Stability of Premixed Laminar Flames Under Zero-Gravity

This paper reports on the numerical study of the linear stability of laminar premixed flames under zero gravity. The study specifically addresses the dependence of stability on finite rate chemistry with low activation energy and variable thermodynamic and transport properties. The calculations show that activation energy and details of chemistry play a minor role in altering the linear neutral stability results from asymptotic analysis. Variable specific heat makes a marginal change to the stability. Variable transport properties on the other hand tend to substantially enhance the stability from critical wave number of about 0.5 to 0.20. Also, it appears that the effects of variable properties tend to nullify the effects of non-unity Lewis number. When the Lewis number of a single species is different from unity, as will happen in a hydrogen-air premixed flame, the stability results remain close to that of unity Lewis number.

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Covalent attachment of two important dicopper(II) systems in a one-dimensional polymeric chain: An x-ray structure of [Cu2(en)2(OH)2·Cu2(O2CMe)4](PF6)2·0.5EtOH]α showing the shortest Cucdots, three dots, centeredCu Distance in the tetraacetato core

Reaction of Cu2(O2CMe)4(H2O)2 with 1,2-diaminoethane(en) in ethanol, followed by the addition of NH4PF6, led to the formation of a covalently linked 1D polymeric copper(II) title complex showing alternating [Cu2(en)2(OH)22+] and [Cu2(O2CMe)4] units in the chain and the shortest Cucdots, three dots, centeredCu separation of 2.558(2) Å in the tetraacetato core.