Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming
Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for generating a number of efficient outcome solu...
Saved in:
| Main Authors: | Le Quang Thuy, Nguyen Thi Bach Kim, Nguyen Tuan Thien |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2011-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2011/464832 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem
by: A. Ed-dahdah, et al.
Published: (2025-06-01) -
Method for solving a convex integer programming problem
by: Stefan M. Stefanov
Published: (2003-01-01) -
Finding the extreme efficient solutions of multi-objective pseudo-convex programming problem
by: Alireza Fakharzadeh Jahromi, et al.
Published: (2025-01-01) -
On Second-Order Duality for Minimax Fractional Programming Problems with Generalized Convexity
by: Izhar Ahmad
Published: (2011-01-01) -
Homotopy Interior-Point Method for a General Multiobjective Programming Problem
by: X. Zhao, et al.
Published: (2012-01-01)