the first step in the design of plate girder is to estimate the self-weight of it. although empirical formulae for the same are available, the level of their accuracy (underestimate or overestimate) with respect to actual self-weight is not known. in this paper, optimized sections are obtained for different spans subjected to different live load carrying capacities and self-weights are estimate...

This paper is concerned with some feasibility issues in mathematical programs with equilibrium constraints (MPECs) where additional joint constraints are present that must be satis ed by the state and design variables of the problems. We introduce su cient conditions that guarantee the feasibility of these MPECs. It turns out that these conditions also guarantee the feasibility of the quadratic...

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i....

Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L-user broadcast channel there are 2L−1 subsets of receivers and correspondingly 2L−1 independent messages. The set of achievable rates for this channel is a 2 − 1-dimensi...

There is little doubt that electronic commerce has penetrated many people’s—and particularly business’—lives in one way or another, during the past few years. But how many businesses really use the Internet? How do they use it? And how are they planning to use it? When it comes to a precise evaluation of the importance of e-commerce, including its dimensions, growth-rate and role in economic gr...

Continuing research begun in 2], we investigate problems of reserving capacity in the arcs of a network, subject to the constraint that, on the failure of any one arc, there is enough reserved capacity on the remaining arcs to support a ow of value T from a source s to a destination t. We also impose upper bounds on the amount of capacity we may reserve on the arcs: this alters the nature of th...