A convergent algorithm for solving linear programs with an additional reverse convex constraint

Lê Dung Muu

Kybernetika (1985)

  • Volume: 21, Issue: 6, page 428-435
  • ISSN: 0023-5954

How to cite

top

Muu, Lê Dung. "A convergent algorithm for solving linear programs with an additional reverse convex constraint." Kybernetika 21.6 (1985): 428-435. <http://eudml.org/doc/29043>.

@article{Muu1985,
author = {Muu, Lê Dung},
journal = {Kybernetika},
keywords = {cutting plane; branch and bound; additional reverse convex constraint},
language = {eng},
number = {6},
pages = {428-435},
publisher = {Institute of Information Theory and Automation AS CR},
title = {A convergent algorithm for solving linear programs with an additional reverse convex constraint},
url = {http://eudml.org/doc/29043},
volume = {21},
year = {1985},
}

TY - JOUR
AU - Muu, Lê Dung
TI - A convergent algorithm for solving linear programs with an additional reverse convex constraint
JO - Kybernetika
PY - 1985
PB - Institute of Information Theory and Automation AS CR
VL - 21
IS - 6
SP - 428
EP - 435
LA - eng
KW - cutting plane; branch and bound; additional reverse convex constraint
UR - http://eudml.org/doc/29043
ER -

References

top
  1. M. Avriel, A. C. Williams, Complementary geometric programming, SIAM J. Appl. Math. /P (1970), 125-141. (1970) Zbl0319.90035MR0267901
  2. M. Avriel, A. C. Williams, An extension of geometric programming with applications in engineering optimization, J. Engng. Math. 5 (1971), 187-194. (1971) 
  3. P. P. Bansal, S. E. Jacobsen, Characterization of local solution for a class of nonconvex programs, J. Optim. Theory Appl. 15 (1975), 127-131. (1975) MR0401151
  4. R. J. Hillestad, Optimization problems subject to a budged constraint with economies of scale, Oper. Res. 23 (1975), 1091-1098. (1975) MR0434447
  5. R. J. Hillestad, S. E. Jacobsen, Linear programs with an additional reverse convex constraint, Appl. Math. Optim. 6 (1980), 257-269. (1980) Zbl0435.90065MR0576263
  6. R. J. Hillestad, S. E. Jacobsen, Reverse convex programming, Appl. Math. Optim. 6 (1980) 63-78. (1980) Zbl0448.90044MR0557055
  7. R. Meyer, The validity of a family of optimization methods, SIAM J. Control 8 (1970), 41-54. (1970) Zbl0194.20501MR0312915
  8. J. B. Rosen, Iterative solution of nonlinear optimal control problems, SIAM J. Control 4 (1766), 223-244. Zbl0229.49025MR0189877
  9. N. V. Thoai, H. Tuy, Convergent algorithms for minimizing a concave function, Math. Oper. Res. 4 (1980), 556-565. (1980) Zbl0472.90054MR0593646
  10. H. Tuy, Concave programming under linear constraints, Dokl. Akad. Nauk SSSR 159 (1964), 32-35. (1964) MR0181465
  11. H. Tuy, Conical algorithm for solving a class of complementarity problems, Preprint series 18 (1981), Hanoi. (1981) Zbl0618.90090MR0683317
  12. U. Ueing, A combinatorical method to compute a global solution of certain nonconvex optimization problems, In: Numerical Methods for Non-Linear Optimization (F. A. Lootsma ed.), pp. 223-230, Academic Press, New York 1972. (1972) MR0429118

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.