Some Sharpening and Generalizations of a Result of T. J. Rivlin

Let p(z)=a_0+a_1z+a_2z~2+a_3z~3+···+a_nz~n be a polynomial of degree n.Rivlin[12]proved that if p(z)≠0 in the unit disk,then for 0r≤1,max|z|=r|p(z)|≥((r+1)/2)~nmax|p(z)||z|=1.In this paper,we prove a sharpening and generalization of this result and show by means of examples that for some polynomials our result can significantly improve the bound obtained by the Rivlin’s Theorem.     

Formulating and Solving the Minimum Dominating Cycle Problem

This paper introduces a formulation for the Minimum Dominating Cycle Problem. Additionally, a Branch and Cut algorithm, based on that formulation, is also investigated. So far, the algorithm contains no primal heuristics. However, it managed to solve to proven optimality, in acceptable CPU times, all test instances with up to 120 vertices.     

Protection of flows under targeted attacks

We present a new robust optimization model for the problem of maximizing the amount of flow surviving the attack of an interdictor. Given some path flow, our model allows the interdictor to specify the amount of flow removed from each path individually. In contrast to previous models, for which no efficient algorithms are known, the most important basic variants of our model can be solved in poly-time. We also consider extensions where there is a budget to set the interdiction costs.     

How to compute least infeasible flows

It is well-known how to use maximum flow to decide when a flow problem with demands, lower bounds, and upper bounds is infeasible. Less well-known is how to compute a flow that is least infeasible. This paper considers many possible ways to define “least infeasible” and shows how to compute optimal flows for each definition. For each definition it also gives a dual characterization in terms of cuts, a polynomial routine for recognizing that type of least infeasible flow, and relates that definition to dual cut canceling min-cost flow network algorithms. This research was partially supported by an NSERC Operating Grant, an NSERC Grant for Research Abroad, and a UBC Killam Faculty Study Leave Fellowship. Parts of this research were done while the author was visiting Laboratoire ARTEMIS IMAG at Université Joseph Fourier de Grenoble, France.     

OTL电路中点电压稳定性三次择优

本文用“稳健设计”的观点,分别对ＯＴＬ电路中点电压稳定性“系统择优”,“参数择优”及“容差择优”作出较为系统的介绍     

Static and dynamic routing under disjoint dominant extreme demands

This paper considers a special case of the robust network design problem where the dominant extreme points of the demand polyhedron have a disjoint support. In this case static and dynamic routing lead to the same optimal solution, both for the splittable and the unsplittable case. As a consequence, the robust network design problem with (splittable) dynamic routing is polynomially solvable, whereas it is co-NP-hard in the general case. This result applies to particular instances of the single-source Hose model.     

A new methodology for evaluating sustainable product design performance with two-stage network data envelopment analysis

Sustainable product design has been considered as one of the most important practices for achieving sustainability. To improve the environmental performances of a product through product design, however, a firm often needs to deal with some difficult technical trade-offs between traditional and environmental attributes which require new design concepts and engineering specifications. In this paper, we propose a novel use of the two-stage network Data Envelopment Analysis (DEA) to evaluate sustainable product design performances. We conceptualize “design efficiency” as a key measurement of design performance in terms of how well multiple product specifications and attributes are combined in a product design that leads to lower environmental impacts or better environmental performances. A two-stage network DEA model is developed for sustainable design performance evaluation with an “industrial design module” and a “bio design module.” To demonstrate the applications of our DEA-based methodology, we use data of key engineering specifications, product attributes, and emissions performances in the vehicle emissions testing database published by the US EPA to evaluate the sustainable design performances of different automobile manufacturers. Our test results show that sustainable design does not need to mean compromise between traditional and environmental attributes. Through addressing the interrelatedness of subsystems in product design, a firm can find the most efficient way to combine product specifications and attributes which leads to lower environmental impacts or better environmental performances. This paper contributes to the existing literature by developing a new research framework for evaluating sustainable design performances as well as by proposing an innovative application of the two-stage network DEA for finding the most eco-efficient way to achieve better environmental performances through product design.     

Product inequalities for norms of linear factors

We give an inequality which bounds the product of the Lp norms of the linear factors of a polynomial by a multiple of the Lp norm of that polynomial. This result generalizes two inequalities of Króo and Pritsker.     

How to solve a semi-infinite optimization problem

After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniques in adaptive convexification procedures. A section on recent genericity results includes a discussion of the symmetry effect in generalized semi-infinite optimization.     

模糊映射的广义混合型强变分不等式

研究了新的一类模糊映射的广义混合型强变分不等式问题。证明了这类问题解的存在定理和收敛定理,给出解的带误差的Ishikawa型迭代算法。     

Inequalities for a polynomial and its derivative

For an arbitrary entire functionf and anyr>0, letM(f,r):=max_|z|=r |f(z)|. It is known that ifp is a polynomial of degreen having no zeros in the open unit disc, andm:=min_|z |=1|p(z)|, then

Remark on a double-inequality for the Riemann zeta function

Let ζ be the Riemann zeta function and δ(x)=1/(2^x-1). For all x>0 we have

(1-δ(x))ζ(x)+αδ(x)<ζ(x+1)<(1-δ(x))ζ(x)+βδ(x),