A new solving procedure by m-M calculus for problems of constrained optimization

  • S. Prešić

Abstract

In this paper we state two procedures for constrained optimization based on the concepts of m-M Calculus. The first procedure is called basic and the second is called quick solving procedure. The quick solving procedure is very effective. It can also be applied to problems of unconstrained optimization.
Published
2016-10-11
How to Cite
PREŠIĆ, S.. A new solving procedure by m-M calculus for problems of constrained optimization. Yugoslav Journal of Operations Research, [S.l.], v. 17, n. 1, oct. 2016. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/280>. Date accessed: 05 dec. 2024.
Citation Formats
Issue
Vol 17 No 1 (2007): Vol. 17 No. 1
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.