✦ LIBER ✦

Objective function bounds for the inexact linear programming problem with generalized cost coefficients

✍ Scribed by Jonathan F. Bard; Sangit Chatterjee

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 824 KB
Volume: 12
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(85)90020-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-linear programming problem with decr

Non-linear programming problem with decreasing cost function and the properties of its solution

✍ N.B. Zyabrev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 579 KB

On stability of stochastic multiobjectiv

On stability of stochastic multiobjective programming problems with random coefficients in the objective functions

✍ Abou-Zaid H. El-Banna; Ebrahim A. Youness 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 186 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

Symmetric duality, and a convergent subg

Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints

✍ W Oettli 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 348 KB