Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse.
We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. SNOPT is a particular implementation that makes use of a semidefinite QP solver. It is based on a limited-memory quasi-Newton approximation to the Hessian of the Lagrangian and uses a reduced-Hessian algorithm (SQOPT) for solving the QP subproblems. It is designed for problems with many thousands of constraints and variables but a moderate number of degrees of freedom (say, up to 2000). An important application is to trajectory optimization in the aerospace industry. Numerical results are given for most problems in the CUTE and COPS test collections (about 900 examples).

/pdf/snopt-an-sqp-algorithm-for-large-scale-constrained-tznz7lt9u8.pdf

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

Analytic hierarchy process : An overview of applications

In this paper, we will propose a Slacks-Based measure (SBM) of efficiency in DEA. This scalar measure deals directly with the input surplus and the output shortage of the decision making unit (DMU) concerned. It is unit invariant and monotone decreasing with respect to input surplus and output shortage. Furthermore, this measure is decided only by consulting with the reference set of the DMU and is not affected by statistics over the whole data set. The new measure has a close connection with other measures proposed so far, e.g., CCR and BCC. The dual side of this model can be interpreted as profit maximization, in contrast to the ratio maximization of the CCR model. Numerical experiments show its validity as an efficiency measurement tool and its compatibility with other measures of efficiency.

A Slacks Based Measure of Efficiency in Data Envelopment Analysis

A slacks-based measure of super-efficiency in data envelopment analysis

Economists have shown that large and persistent differences in productivity levels across businesses are ubiquitous. This finding has shaped research agendas in a number of fields, including (but not limited to) macroeconomics, industrial organization, labor, and trade. This paper surveys and evaluates recent empirical work addressing the question of why businesses differ in their measured productivity levels. The causes are manifold, and differ depending on the particular setting. They include elements sourced in production practices -- and therefore over which producers have some direct control, at least in theory -- as well as from producers' external operating environments. After evaluating the current state of knowledge, I lay out what I see are the major questions that research in the area should address going forward. (JEL D24, G31, L11, M10, O30, O47)

/pdf/what-determines-productivity-2hh0dpac5x.pdf

What Determines Productivity

Super-efficiency dea models

Abstmci We will point out some relations between potential and barrier function methods for linear programming. Then, based on the relations, we will show that the classical logarithmic barrier function method for linear programming can be adjusted so that it generates the optimal solution in O( .\"jnL) iterations, where n is the number of variables and L is the data length. The method can be seen as a barrier function version of Ye's \"An O( n 3 L) potential reduction algorithm for linear programming\".

Kaoru Tone

Papers

Super-efficiency dea models

Remarks on potential versus barrier function methods for linear programming

Site selection for the next-generation supercomputing center of japan

Dea as a kaizen tool

A Note on Group vs. Individual Decision Making in the Analytic Hierarchy Process