Titlebook: Mathematiacl Programming Essays in Honor of George B. Dantzig Part II; Richard W. Cottle Book 1985Latest edition Springer-Verlag Berlin He

Cantankerous

On the quadratic programming algorithm of Goldfarb and Idnani,he author has provided for general use [8] a Fortran subroutine that applies the faster implementation. This subroutine is compared with two widely available quadratic programming subroutines that employ feasible point methods, namely QPSOL [4] and VEO2A

Junction

Critical path planning under uncertainty, find the minimum investment required as a function of expected project completion time. The problem is solved by a cutting plane technique in which the investment allocations yield feasibility cuts. Because of the special structure of this problem, these cuts can be generated by solving a sequence of longest path problems in an acyclic network.

Mendacious

A generalized Benders decomposition approach to reactive source planning in power systems,.Noting successful experience in other location problems with Benders decomposition algorithm, the Generalized Benders method is applied. Even though the convexity assumptions needed to guarantee success may not be satisfied, the procedure performs well. Results are presented for systems of small, medium, and large dimensions.

流行

Existence and characterization of minima of concave functions on unbounded convex sets,n at infinity in every extreme direction is linear in the directions, it is shown that the function attains its minimum on the set if and only if a pair of linear functions attains its lexicographic minimum on the set.

使显得不重要

On the principle of monotone likelihood and log-linear models,ntial and normal distributions, Maxwell-Boltzmann’s distribution for the speeds of the molecules of an ideal gas, the Maxwell-Boltzmann energy distribution law, the gravity model in transportation planning.

SSRIS

Springer-Verlag Berlin Heidelberg 1985

neolith

Mathematiacl Programming Essays in Honor of George B. Dantzig Part II978-3-642-00921-1Series ISSN 0303-3929 Series E-ISSN 2364-8201

Iniquitous

杀子女者

Minimizing a unimodal function of two integer variables, its value (not its gradient), and that only at integer-valued points in its domain. Its minimum over the integers is required. We present an algorithm, which seems reasonably efficient, for solving this problem in the case of two variables. The algorithm can be extended to handle a quadratic function of three variables.

惊惶

Using deep cuts in an ellipsoid algorithm for nonlinear programming,ut hyperplanes are used to generate the next ellipsoid from the current one. Efficiency and robustness are compared when the variants are used to solve convex and nonconvex problems. Statistics on the frequency and the depth of the various cuts are also reported.