Multi-Item Fuzzy Inventory Problem With Space Constraint Via Geometric Programming Method
Optimization is an important tool widely used in formulation of the mathematical model and design of various decision making problems related to the science and engineering. Generally, the real world problems are occurring in the form of multi-criteria and multi-choice with certain constraints. There is no such single optimal solution exist which could optimize all the objective functions simultaneously. In this paper, ϵ-constraint method along with Karush−Kuhn−Tucker (KKT) condition has been used...
In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...
In this paper, we develop a supply chain network equilibrium model in which electronic commerce in the presence of both B2B (business-to-business) and B2C (business-to-consumer) transactions, multiperiod decision-making and multicriteria decision-making are integrated. The model consists of three tiers of decision-makers (manufacturers, retailers and consumers at demand markets) who compete within a tier but may cooperate between tiers. Both manufacturers and retailers are concerned with maximization...
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
The principal modelling and simulation features of multistage interconnection networks operating in packet switching are discussed in this paper. The networks studied interconnect processors and memory modules in multiprocessor systems. Several methods are included to increase the bandwidth achievable with this kind of networks. Besides using network buffering, the possibility of having queues of requests at the memory modules is considered. Network conflicts can be reduced using a second network...
Nanonetwork is defined as a mathematical model of nanosize objects with biological, physical and chemical attributes, which are interconnected within certain dynamical process. To demonstrate the potentials of this modeling approach for quantitative study of complexity at nanoscale, in this survey, we consider three kinds of nanonetworks: Genes of a yeast are connected by weighted links corresponding to their coexpression along the cell cycle; Gold nanoparticles, arranged on a substrate, are linked...
Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are N groups of drivers, The i-th group consists of κi drivers, sharing the same departure and arrival costs ϕi(t),ψi(t). For any given population sizes κ1,...,κn, we prove the existence of a Nash equilibrium solution, where no driver can lower his own total cost by choosing a different departure...
The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various variants of...