微分学中不等式的证明

针对微分学不等式列出五种常用证明方法,即利用单调性证明法,利用拉格朗日中值定理证明法,利用最值证明法,利用泰勒公式证明法,和利用凹凸性证明法.实例说明每种方法的使用细节,以达到使初学者能尽快掌握微分学不等式证明的目的.     

构造函数证明不等式

不等式的证明是中学数学的一个很重要的内容,也是一个难点内容.证明不等式有很多种方法,其中通过构造函数来证明不等式是一个非常重要的方法.通过找到不等式的代数式与函数之间的联系,根据这些代数式的特点构造函数,再用函数的性质就能很快捷、方便地证明不等式.本文探讨用不同的方法构造函数,并结合典型高考题研究构造函数证明不等式的技巧和方法.     

导数在不等式证明中的应用探究

不等式常见的证明方法有构造法、比较法、反证法等,但是,一些不等式利用这些方法证明比较困难,而利用导数证明不等式不但能精简证明流程,而且能确保证明结果的准确性.本文中主要分析了利用函数凹凸性、导数定义、拉格朗日中值定理证明不等式的详细方式,且给出了多种方式的适用范畴,结合实际情况整理了使用多种方式开展不等式证明的主要观点.     

构造单调数列证明一类不等式

文[1]介绍了证明与自然数有关的一类不等式的方法——构造数列证明不等式．经笔者研究，发现此类不等式可用构造单调数列，利用数列的单调性予以证明，此法简便，易于操作．     

不等式的性质和证明

本单元的重点是：实数大小的比较，不等式的基本性质，重要不等式，不等式的证明方法，不等式的性质贯穿于不等式的证明、求解和实际应用之中，它是不等式变形的重要依据，不等式的证明是应用化归思想完成从已知到待证结论的一个转化过程，在转化过程中一般要利用不等式的基本性质、重要不等式、函数的单调性等。     

用单调性证明数列的连续项积型不等式

对数列连续项积型不等式,文[1]给出了用其成立的一个充分条件证明的方法.笔者探究发现,用单调性证明某些此类不等式更简便.用单调性证明数列的连续项积型不等式的具体做法是:当所证不等式一边是常数时,直接根据     

构造函数证明不等式

在初等数学中,证明不等式的方法、技巧较多,但遇到一些无从下手,很难找到切入点的不等式的证明时,我们不妨变换一下思维角度,运用函数思想,从所证不等式的结构特征出发,恰当构造函数,合理借助函数的单调性、最值等,使不等式得以证明．     

一个积分不等式的九种证明方法

积分不等式是微积分学中一类常见而又重要的不等式,其证明方法多种多样．分别用定积分的定义、积分变限函数、积分第一、第二中值定理、微分中值定理等九种方法证明积分不等式∫0^1xf（x）dx≥1/2∫0^1f（x）dx（其中f（x）在[0,1]上连续而且单调递增）,借此介绍证明积分不等式的几种常用的方法．     

用单调性证明数列的连续项积型不等式

对数列连续项积型不等式，文[1]给出了用其成立的一个充分条件证明的方法．笔者探究发现，用单调性证明某些此类不等式更简便．     

构造函数证明不等式

在初等数学中,证明不等式的方法、技巧较多,但遇到一些无从下手,很难找到切入点的不等式的证明时,我们不妨变换一下思维角度,运用函数思想,从所证不等式的结构特征出发,恰当构造函数,合理借助函数的单调性、最值等,使不等式得以证明.     

Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain

In this paper, we study the problem of synchronized scheduling of assembly and air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain. This problem was motivated by a major PC manufacturer in consumer electronics industry. The overall problem is decomposed into two sub-problems, which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as an integer linear programming problem with the objective of minimizing transportation cost and delivery earliness tardiness penalties. The assembly scheduling problem seeks to determine a schedule ensuring that the orders are completed on time and catch the flights such that the waiting penalties between assembly and transportation is minimized. The problem is formulated as a parallel machine scheduling problem with earliness penalties. The computational complexities of the two sub-problems are investigated. The air transportation allocation problem with split delivery is shown to be solvable. The parallel machine assembly scheduling problem is shown to be NP-complete. Simulated annealing based heuristic algorithms are presented to solve the parallel machine problem.     

Single machine stochastic JIT scheduling problem subject to machine breakdowns

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.     

The Vehicle Routing-Allocation Problem: A unifying framework

Summary In this paper the Vehicle Routing-Allocation Problem (VRAP) is presented. In VRAP not all customers need be visited by the vehicles. However customers not visited either have to be allocated to some customer on one of the vehicle tours or left isolated. We concentrate our discussion on the Single Vehicle Routing-Allocation Problem (SVRAP). An integer linear programming formulation of SVRAP is presented and we show how SVRAP provides a unifying framework for understanding a number of the papers and problems presented in the literature. Specifically the covering tour problem, the covering salesman problem, the median tour problem, the maximal covering tour problem, the travelling salesman problem, the generalised travelling salesman problem, the selective travelling salesman problem, the prize collecting travelling salesman problem, the maximum covering/shortest path problem, the maximum population/shortest path problem, the shortest covering path problem, the median shortest path problem, the minimum covering/shortest path problem and the hierarchical network design problem are special cases/variants of SVRAP.     

Continuous quadratic programming formulations of optimization problems on graphs

Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This continuous formulation is compared to known continuous quadratic programming formulations for the edge separator problem, the maximum clique problem, and the maximum independent set problem. All of these formulations, when expressed as maximization problems, are shown to follow from the convexity properties of the objective function along the edges of the feasible set. An algorithm is given which exploits the continuous formulation of the vertex separator problem to quickly compute approximate separators. Computational results are given.     

Some duality relationships for the generalized Neyman-Pearson problem

In 1963, Kuhn presented a dual problem to a relatively well-known location problem, variously referred to as the generalized Fermat problem and the Steiner-Weber problem. The purpose of this paper is to point out how Kuhn's results can be adapted to provide a dual to the generalized Neyman-Pearson problem, a problem of fundamental interest in statistics, which has applications in control theory and a number of other areas. The Neyman-Pearson problem, termed the dual problem, is a constrained maximization problem and may be considered to be a calculus-of-variations analog to the bounded-variable problem of linear programming. When the dual problem has equality constraints, the primal problem is an unconstrained minimization problem. Duality results are also obtained for the case where the dual problem has inequality constraints.This work was partially supported by the National Science Foundation, Grant Nos. NSF-GK-1571 and NSF-GK-3038. The authors would like to acknowledge the very useful comments of one of the referees, which led to more direct and general proofs of Properties 2.3 and 2.6.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm

In this paper, the equilibrium optimization problem is proposed and the assignment problem is extended to the equilibrium multi-job assignment problem, equilibrium multi-job quadratic assignment problem and the minimum cost and equilibrium multi-job assignment problem. Furthermore, the mathematical models of the equilibrium multi-job assignment problem and the equilibrium multi-job quadratic assignment problem with fuzzy parameters are formulated. Finally, a genetic algorithm is designed for solving the proposed programming models and some numerical examples are given to verify the efficiency of the designed algorithm.     

Packing strong subgraph in digraphs

In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as generalizations of the famous Steiner tree packing problem and are closely related to the strong arc decomposition problem. We first prove the NP-completeness for the internally disjoint strong subgraph packing problem restricted to symmetric digraphs and Eulerian digraphs. Then we get inapproximability results for the arc-disjoint strong subgraph packing problem and the internally disjoint strong subgraph packing problem. Finally we study the arc-disjoint strong subgraph packing problem restricted to digraph compositions and obtain some algorithmic results by utilizing the structural properties.     

一些约束规划问题的近似全局最优解

首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题．最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解．