✦ LIBER ✦

The Difference between Finite Dimensional Linear Programming Problems and Infinite Dimensional Linear Programming Problems

✍ Scribed by Tvu-Ying Ho; Yuung-Yih Lur; Soon-Yi Wu

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 161 KB
Volume: 207
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.1997.5279

No coin nor oath required. For personal study only.

✦ Synopsis

This paper studies the difference between finite-dimensional linear programming problems and infinite dimensional linear programming problems. We discuss a special class of continuous linear programming problems. We develop the structure of extreme points of feasible region for this problem. Under some conditions we can characterize all extreme points of this problem. We show that under some conditions the optimal value for this problem may be finite but there is no optimal solution for it. Finally, we construct an example for this problem which has an optimal solution but all extreme points for this problem are not optimal solutions.

📜 SIMILAR VOLUMES

Three-dimensional non-linear fluid-struc

Three-dimensional non-linear fluid-structure interaction problems: Formulation by the finite and infinite element method

✍ Y. Q. Feng; J. P. Quevat 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 499 KB 👁 1 views

Using the perturbation method, the non-linear exterior fluid-structure interaction problem is separated into first-and second-order problems. With the finite element method for the structure and the finite-infinite element method for the fluid, we obtain a first-order coupled matrix system and a sec

Fourth-order finite difference methods f

Fourth-order finite difference methods for three-dimensional general linear elliptic problems with variable coefficients

✍ U. Ananthakrishnaiah; R. Manohar; J. W. Stephenson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

A note on the strategy of restriction an

A note on the strategy of restriction and degenerate linear programming problems

✍ Charles A. Holloway 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w

An extension of the one-dimensional von

An extension of the one-dimensional von Rosenberg finite difference scheme to multidimensional problems of the convection dispersion equation

✍ Muktar Ali El-Ageli; Gianluigi Chierici 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB

A two-dimensional stochastic algorithm f

A two-dimensional stochastic algorithm for the solution of the non-linear Poisson–Boltzmann equation: validation with finite-difference benchmarks

✍ Kausik Chatterjee; Jonathan Poggie 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB