An inequality which is not an abstract geometric inequality

Authors

  • Eugenia Duca Polytechnic Institute, Cluj-Napoca, Romania
Abstract views: 135

Abstract

Not available.

Downloads

Download data is not yet available.

References

Duca, E., A convex Dual for the Problem of Geometric Programming without Constraints, Seminarul "Theodor Angheluţă" I, 10-12, June 1983, pp. 93-98.

Duca, Eugenia A convex dual for the general problem of geometric programming. Anal. Numér. Théor. Approx. 13 (1984), no. 1, pp. 23-31, MR0797796.

Duca, E., Linear Approximating Programs for the Geometric Programming Problem, Babeş-Bolyai Unviersity, Cluj-Napoca, Seminar on Optimization Theory, Report no. 5, 1985, pp. 51-62.

Duffin, Richard J.; Peterson, Elmor L.; Zener, Clarence Geometric programming: Theory and application. John Wiley & Sons, Inc., New York-London-Sydney 1967 xi+278 pp., MR0214374.

Maruşciac, I., Programare geometrică şi aplicaţii, Editura Dacia, Cluj-Napoca, 1978.

Downloads

Published

1987-02-01

How to Cite

Duca, E. (1987). An inequality which is not an abstract geometric inequality. Anal. Numér. Théor. Approx., 16(1), 35–39. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1987-vol16-no1-art5

Issue

Vol. 16 No. 1 (1987)

Section

Articles

License

Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory

Creative Commons License

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

Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.