权有附加约束的条件下的DEA有效性(C2R或C2GS2)

有关判别决策单元在权有附加约束的条件下是否DEA有效（C^2或C^2GS^2)，本文给出了一种基于权有附加约束条件下的加性模型的不同于文献[1]与[2]的约束与差别法。     

成本最小问题与(弱)DEA有效性

在文[1]的基础上,本文证明了在一定条件下对所给的决策单元、其弱DEA有效性或DEA有效性能由成本最小问题的最优解来判断.     

DEA中连续C~2R模型理论的研究

在DEA中的C2R模型的基础上,针对决策单元输入与输出为[0,1]区间上的连续函数,建立了在一个时间区间内评价决策单元间的相对有效性的连续C2R模型以及其对偶模型,同时给出了决策单元的效率定义和弱DEA有效、DEA有效的定义.同时得到了弱对偶定理,从而初步构建了连续C2R模型的理论体系.     

技术有效的决策单元与DEA有效性(C~2GS~2)

对李光金、阎洪先生所定义的技术有效的决策单元,证明了它是DEA有效(C~2GS~2)的,而且讨论了将非有效的决策单元转变为有效.     

单位(k-μ)/(l_τ)型最优服务问题

本文是文献[1]、[2]的推广.文献[1]、[2]研究了被服务单元在得到服务期间计算其损失的一类最优服务问题,其中作了如下假定:(1)服务效率只与服务单元有关,而与被服务单元无关;(2)单位损失(即被服务单元在得到服务期间的单位时间损失)只与被服务单元有关,而与服务单元无关.但是,由于对服务效率和单位损失作了上述假定,使得一些更为广泛的实际问题不能概     

有关判断决策单元的DEA有效性的新方法的探讨

为了判断决策单元是否(弱)DEA有效并克服现有的模型及[1]中模型在解决上述问题时的不足之处,本文将讨论的新模型是由CCR模型与CCGSS模型变来的,且定理的证明不同于[1]．还讨论了文中新模型的最优解的存在性,此外,研究了所有决策单元的输入输出的变化对某决策单元有效性的影响．     

具有吸引项的反应扩散型和拟抛物方程解的全局死核问题

在文[1、2]文[3、6]基础上,应用文[7、8]的方法和相应结论,在古典解存在且唯一的条件下,结合文[10、11]研究具吸引项的反应扩散方程(1)的死核问题,且进一步讨论了跟一般的非线性抛物型方程(2)解的全局死核问题,得到新的结果和时间估计.     

具有固定行列和k的阶为2k-2的(0,1)-矩阵的最大跳跃数

1992年Brualdi与Jung首次引出了最大跳跃数M(n,k),即每行每列均含k个1的阶为n的(0,1)-矩阵的跳跃数的极大数,给出了满足条件1≤k ≤n ≤10的(0,1)-矩阵的最大跳跃数M(n,k)的一个表,并提出了几个猜想,其中包括猜想M(2k-2,k)=3k-4 [k-2/2].本文证明了当k≥11时,对每个A∈∧(2k-2,k)有b(A)≥4.还得到了该猜想的另一个反例.     

加性DEA模型与规模收益

[1]给出了用C^2R模型或C^2GS^2模型来判断决策单元的规模收益情况的定理,指出它有时失效。对DEA有效（C^2GS^2）的决策单元,本用加性DEA模型来有效地判断其规模收益情况。     

样本评价DEA模型的灵敏度分析

利用样本评价DEA模型的有效性理论,对决策单元的有效性进行灵敏度分析,给出了当移动因子d保持不变时,样本单元和决策单元的输入或输出变化后,决策单元的有效性保持不变的充分条件和必要条件,此外还给出了使决策单元的有效性保持不变的移动因子d的精确变化范围,最后通过实例表明了该灵敏度分析方法的可行性.     

Profit maximization with quantity discount: An application of geometric programming

Profit maximization is an important issue to the firms that pursue the largest economic profit possible. Traditionally, profit maximization problem is solved by differentiating with respect to input prices. The total differentiation of the first-order conditions might give complicated equations difficult to handle. Different from traditional studies, this paper considers input quantity discount and employs geometric programming technique to derive the objective value for the profit-maximization problem. The geometric programming approach not only gives the global optimum solution but also provides the information that is able to discover the relationship between profit maximization and returns to scale in the solution process. No differentiation is required. Moreover, geometric programming can provide a computationally attractive view of sensitivity analysis for the changes in parameters. Examples are given to illustrate the idea proposed in this paper.     

A Variant of Multi-task n-vehicle Exploration Problem: Maximizing Every Processor’s Average Profit

We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor’s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.     

Optimal Distributed Dynamic Advertising

We propose a novel approach to modeling advertising dynamics for a firm operating over a distributed market domain based on controlled partial differential equations of the diffusion type. Using our model, we consider a general type of finite-horizon profit maximization problem in a monopoly setting. By reformulating this profit maximization problem as an optimal control problem in infinite dimensions, we derive sufficient conditions for the existence of its optimal solutions under general profit functions, as well as state and control constraints, and provide a general characterization of the optimal solutions. Sharper, feedback-form characterizations of the optimal solutions are obtained for two variants of the general problem. The first author gratefully acknowledges financial support by the NSF, the DAAD, the SFB 611 (Bonn), and the Max-Planck-Institut für Mathematik (Leipzig) through an IPDE fellowship.     

信息熵增量最小化准则在供应链中的应用

本文研究了在考虑利润最大化准则和信息熵增量最小准则下，既能满足了利润最大化，又要增加利润可得性，销售商如何确定订购量的问题。数字实验表明：考虑双重准则得到的策略比仅考虑利润最大化准则得到的策略更好，可以使供应链、销售商及制造商都受益。     

Large-Scale Joint Price-Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set

This article addresses a generalization of the capacitated lot-size problem (CLSP) as well as the profit maximization capacitated lot-size problem (PCLSP) considering joint price inventory decisions. This problem maximizes profit over a discrete set of prices subject to resource limitations. We propose a heuristic based on Lagrangian relaxation to resolve the problem, especially aiming for large scale cases. Results of experimentation exhibit the major importance of the capacity constraint. When this one is weak, our heuristic performs particularly well, moreover the numbers of possible prices does not really impact the results.     

报童问题及其商业拓展的两类利润期望模型

基于会计利润与经济利润的不同意义和经济利润在经济管理中的重要性,明确区分并解释了离散型随机需求量报童问题及其商业拓展的这两类利润期望,得出了随机需求量取值个数有限的报童问题及其商业拓展的会计利润期望模型和经济利润期望模型及其利润期望最大化进货量的计算关系式;着重区分了相应的显性成本期望和隐性成本期望;指出求解此类问题运筹学的处理方法与经济学原理并不相悖.     

Multiple goals and ownership structure: Effects on the performance of Spanish savings banks

Spanish savings banks (SBs) are financial institutions with a wide mission that includes different stakeholders’ goals. Profit maximization is only one among several goals, and the widespread use of cost or profit efficiency as the only comparative performance measure may prove to be insufficient in this context. To overcome this problem, we build an aggregate performance index for organizations with multiple goals. Furthermore, we show how the ownership structure of SBs influences their economic behavior in two basic ways: (1) the performance level and (2) their goal priorities. In particular, we distinguish two types of ownership structures in our application, namely, organizations controlled by Public Administrations and those controlled by insiders (i.e. managers and workers). Our results indicate that each type has different priorities and differ in their performance indexes. More specifically, the empirical analysis shows that insider-controlled SBs favor goals related to profit maximization and the universal access to financial services and, furthermore, they perform better. In contrast, contributing to regional development becomes the most favored goal when Public Administrations have a majority in the bank.     

Profit maximization problem for Cobb–Douglas and CES production functions

Production functions are used to model the production activity of enterprises. In this article, we formulate the necessary and sufficient conditions of strict concavity for Cobb–Douglas and constant elasticity of substitution (CES) production functions. These conditions constitute the theoretical foundation for analyzing the profit maximization problem. An optimal solution is constructed in analytical form and some of its properties are described. Three approaches to solving the profit maximization problem are considered and their equivalence is established. For a Cobb–Douglas production function we investigate the dependence of the maximum profit on elasticity coefficients. A similar analysis is carried out also for the CES production function. The article presents a systematic and detailed discussion of the relevant topics. The topic is related to the investigation of innovation activity of enterprises. The theoretical results and the explicit analytical relationships provide a theoretical and algorithmic base for the “Planer” optimization software—a useful product for the analysis of the production activity of enterprises modeled by production function tools.     

Undergraduate Students’ Quantitative Reasoning in Economic Contexts

Contributing to a growing body of research on undergraduate students’ quantitative reasoning, the study reported in this article used task-based interviews to investigate business calculus students’ quantitative reasoning when solving two optimization tasks situated in the context of revenue and profit maximization. Analysis of verbal responses and work written by 12 pairs of students during the task-based interviews revealed that nearly all pairs of students created new quantities (e.g., diminishing marginal returns). Students used these new quantities to reason about relationships among computer sales, sales discount, and total revenue in a revenue maximization task. The creation of these quantities helped the students to solve the problem posed in the task. Ten pairs of students interpreted marginal cost as total cost and marginal revenue as total revenue in a profit maximization task. Implications for business calculus instruction and directions for future research are discussed.     

Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: A case study

In this paper, we deal with actual problems on production and work force assignment in a housing material manufacturer and a subcontract firm. We formulate two kinds of two-level programming problems: one is a profit maximization problem of both the housing material manufacturer and the subcontract firm, and the other is a profitability maximization problem of them. Applying the interactive fuzzy programming for two-level linear and linear fractional programming problems, we derive satisfactory solutions to the problems. After comparing the two problems, we discuss the results of the applications and examine actual planning of the production and the work force assignment of the two firms to be implemented.