LEKSIKOGRAFIK GEOMETRİK PROGRAMLAMA (LGP)

Year 1996, , 153 - 156, 10.01.1996

Mikulas Luptacik Frantisek Turnovec Translator: Tuncay Can

https://doi.org/10.14783/maruoneri.713024

Abstract

The paper presents the Kuhn-Tucker conditions and
duality theory for the lexicographic minimization problem:
iex m in{F (x)|x e R n,G (x ) < O mj
where F and G are vector valued functions form R„ -~*RS and
Rn —>Rm , respectively. The lexicographic duality is then
applied for problems with polynomials in the objectives and in
the constraints.

Keywords

Leksikografi, Geometri, Programlama

References

• [1] - Beightler, Ch.S., and Phillips, D.T., Applied Geometric Programming, Wiley, New York, 1976.
• [2] - Duffin, R.J., Peterson, E.L., and Zener, C.M., Geometric Programming, Wiley, New York, 1967.
• [3] -Isermann, H., Linear Lexicographic optimization, OR. Spectrum 4, 223-228, 1982.
• [4] - Martinez-Legar, J.E., Lexicographic order and duality in multiobjective programming, European Journal of Operational Research 33, 342-348, 1988