Uneven distribution of ventilation—perfusion ratios in lungs estimated by a modified Newton method Takeo KawashiroFumihiro YamasawaKunio Tanabe OriginalPaper Pages: 1 - 9
Application of sequential quadratic programming software program to an actual problem M. TamuraY. Kobayashi OriginalPaper Pages: 19 - 27
On area-efficient drawings of rectangular duals for VLSI floor-plan Katsunori TaniShuji TsukiyamaIsao Shirakawa OriginalPaper Pages: 29 - 43
Optimization of pipe networks Claus Thorp HansenKaj MadsenHans Bruun Nielsen OriginalPaper Pages: 45 - 58
Branch and bound with estimation based on pseudo-shadow-prices Bjørn Nygreen OriginalPaper Pages: 59 - 69
Utilization of mathematical programming for public systems: An application to effective formation of integrated regional information networks Fumiko Seo OriginalPaper Pages: 71 - 98
Approximate formulas of average distances associated with regions and their applications to location problems Takeshi KoshizukaOsamu Kurita OriginalPaper Pages: 99 - 123
Sequential location—allocation of public facilities in one- and two-dimensional space: Comparison of several policies Tsutomu SuzukiYasushi AsamiAtsuyuki Okabe OriginalPaper Pages: 125 - 146
The influence curve approach in data envelopment analysis Jati K. Sengupta OriginalPaper Pages: 147 - 166
Algorithms for generalized fractional programming Jean-Pierre CrouzeixJacques A. Ferland OriginalPaper Pages: 191 - 207
Interior point algorithms for linear programming with inequality constraints Clovis C. Gonzaga OriginalPaper Pages: 209 - 225
An analytical approach to global optimization Pierre HansenBrigitte JaumardShi-Hui Lu OriginalPaper Pages: 227 - 254
Hyperbolic 0–1 programming and query optimization in information retrieval Pierre HansenMarcus V. Poggi de AragãoCelso C. Ribeiro OriginalPaper Pages: 255 - 263
On the convergence of Han's method for convex programming with quadratic objective Alfredo N. IusemAlvaro R. De Pierro OriginalPaper Pages: 265 - 284
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization Krzysztof C. Kiwiel OriginalPaper Pages: 285 - 302
Lagrangean decomposition for integer nonlinear programming with linear constraints Philippe MichelonNelson Maculan OriginalPaper Pages: 303 - 313
An analytical comparison of different formulations of the travelling salesman problem Manfred PadbergTing-Yi Sung OriginalPaper Pages: 315 - 357
Multi-stage stochastic optimization applied to energy planning M. V. F. PereiraL. M. V. G. Pinto OriginalPaper Pages: 359 - 375
Global convergence of the affine scaling methods for degenerate linear programming problems Takashi Tsuchiya OriginalPaper Pages: 377 - 404
Comparative analysis of affine scaling algorithms based on simplifying assumptions Yinyu Ye OriginalPaper Pages: 405 - 414
On lower bound updates in primal potential reduction methods for linear programming Clovis C. Gonzaga OriginalPaper Pages: 415 - 428
A combined phase I—phase II scaled potential algorithm for linear programming Kurt M. Anstreicher OriginalPaper Pages: 429 - 439
A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start” Robert M. Freund OriginalPaper Pages: 441 - 466
Improving the rate of convergence of interior point methods for linear programming Vera V. Kovacevic-Vujcic OriginalPaper Pages: 467 - 479
A survey of search directions in interior point methods for linear programming D. den HertogC. Roos OriginalPaper Pages: 481 - 509
Integrability of vector and multivector fields associated with interior point methods for linear programming Masao Iri OriginalPaper Pages: 511 - 525
On the complexity of following the central path of linear programs by linear extrapolation II G. SonnevendJ. StoerG. Zhao OriginalPaper Pages: 527 - 553
Computational results of an interior point algorithm for large scale linear programming N. K. KarmarkarK. G. Ramakrishnan OriginalPaper Pages: 555 - 586
An O(n 3 L) adaptive path following algorithm for a linear complementarity problem Shinji MizunoMichael J. Todd OriginalPaper Pages: 587 - 595
An interior point algorithm to solve computationally difficult set covering problems Narendra KarmarkarMauricio G. C. ResendeK. G. Ramakrishnan OriginalPaper Pages: 597 - 618