IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v100y1999i2d10.1023_a1021794505701.html
   My bibliography  Save this article

On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case

Author

Listed:
  • V. Preda

    (University of Bucharest)

  • I. Chiţescu

    (University of Bucharest)

Abstract

Some versions of constraint qualifications in the semidifferentiable case are considered for a multiobjective optimization problem with inequality constraints. A Maeda-type constraint qualification is given and Kuhn–Tucker-type necessary conditions for efficiency are obtained. In addition, some conditions that ensure the Maeda-type constraint qualification are stated.

Suggested Citation

  • V. Preda & I. Chiţescu, 1999. "On Constraint Qualification in Multiobjective Optimization Problems: Semidifferentiable Case," Journal of Optimization Theory and Applications, Springer, vol. 100(2), pages 417-433, February.
    • Handle: RePEc:spr:joptap:v:100:y:1999:i:2:d:10.1023_a:1021794505701
    DOI: 10.1023/A:1021794505701
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021794505701
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021794505701?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. Isermann, 1974. "Technical Note—Proper Efficiency and the Linear Vector Maximum Problem," Operations Research, INFORMS, vol. 22(1), pages 189-191, February.
    2. Kaul, R. N. & Kaur, Surjeet, 1982. "Generalizations of convex and related functions," European Journal of Operational Research, Elsevier, vol. 9(4), pages 369-377, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Balendu Bhooshan Upadhyay & Shubham Kumar Singh & Ioan Stancu-Minasian, 2024. "Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators," Mathematics, MDPI, vol. 12(20), pages 1-21, October.
    2. X. F. Li & J. Z. Zhang, 2006. "Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 429-452, December.
    3. M. C. Maciel & S. A. Santos & G. N. Sottosanto, 2009. "Regularity Conditions in Differentiable Vector Optimization Revisited," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 385-398, August.
    4. Regina S. Burachik & M. M. Rizvi, 2012. "On Weak and Strong Kuhn–Tucker Conditions for Smooth Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 477-491, November.
    5. Tadeusz Antczak, 2023. "On directionally differentiable multiobjective programming problems with vanishing constraints," Annals of Operations Research, Springer, vol. 328(2), pages 1181-1212, September.
    6. Altannar Chinchuluun & Dehui Yuan & Panos Pardalos, 2007. "Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity," Annals of Operations Research, Springer, vol. 154(1), pages 133-147, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. E. Carrizosa & E. Conde & M. Muñoz-Márquez, 1998. "Admission Policies in Loss Queueing Models with Heterogeneous Arrivals," Management Science, INFORMS, vol. 44(3), pages 311-320, March.
    2. Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
    3. H. P. Benson & E. Sun, 2000. "Outcome Space Partition of the Weight Set in Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 17-36, April.
    4. Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
    5. Jesús A. De Loera & Raymond Hemmecke & Matthias Köppe, 2009. "Pareto Optima of Multicriteria Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 39-48, February.
    6. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    7. Stancu-Minasian, I.M., 2006. "Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions," European Journal of Operational Research, Elsevier, vol. 173(1), pages 47-58, August.
    8. Hachem Slimani & Shashi Kant Mishra, 2014. "Multiobjective Fractional Programming Involving Generalized Semilocally V-Type I-Preinvex and Related Functions," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2014, pages 1-12, May.
    9. Eduardo Camponogara & Sarosh N. Talukdar, 2005. "Designing Communication Networks to Decompose Network Control Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 207-223, May.
    10. Erin K. Doolittle & Hervé L. M. Kerivin & Margaret M. Wiecek, 2018. "Robust multiobjective optimization with application to Internet routing," Annals of Operations Research, Springer, vol. 271(2), pages 487-525, December.
    11. Siming Pan & Shaokai Lu & Kaiwen Meng & Shengkun Zhu, 2021. "Trade-Off Ratio Functions for Linear and Piecewise Linear Multi-objective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(2), pages 402-419, February.
    12. Alexander Engau, 2015. "Definition and Characterization of Geoffrion Proper Efficiency for Real Vector Optimization with Infinitely Many Criteria," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 439-457, May.
    13. Mehdi Allahdadi & Aida Batamiz, 2021. "Generation of some methods for solving interval multi-objective linear programming models," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 1077-1115, December.
    14. Johannes M. Schumacher, 2018. "A Multi-Objective Interpretation of Optimal Transport," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 94-119, January.
    15. Giorgio Giorgi, 2021. "Some Classical Directional Derivatives and Their Use in Optimization," DEM Working Papers Series 204, University of Pavia, Department of Economics and Management.
    16. Soylu, Banu, 2018. "The search-and-remove algorithm for biobjective mixed-integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 268(1), pages 281-299.
    17. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.
    18. Suneja, S. K. & Gupta, Sudha, 1998. "Duality in multiobjective nonlinear programming involving semilocally convex and related functions," European Journal of Operational Research, Elsevier, vol. 107(3), pages 675-685, June.
    19. Fulga, C. & Preda, V., 2009. "Nonlinear programming with E-preinvex and local E-preinvex functions," European Journal of Operational Research, Elsevier, vol. 192(3), pages 737-743, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:100:y:1999:i:2:d:10.1023_a:1021794505701. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.