IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v117y1999i1p183-196.html
   My bibliography  Save this article

Johri's general dual, the Lagrangian dual, and the surrogate dual

Author

Listed:
  • Nieuwenhuizen, Thorsten

Abstract

No abstract is available for this item.

Suggested Citation

  • Nieuwenhuizen, Thorsten, 1999. "Johri's general dual, the Lagrangian dual, and the surrogate dual," European Journal of Operational Research, Elsevier, vol. 117(1), pages 183-196, August.
  • Handle: RePEc:eee:ejores:v:117:y:1999:i:1:p:183-196
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00206-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Johri, Pravin K., 1994. "Derivation of duality in mathematical programming and optimization theory," European Journal of Operational Research, Elsevier, vol. 73(3), pages 547-554, March.
    2. Johri, Pravin K., 1999. "Implied constraints and LP duals of general nonlinear programming problems," European Journal of Operational Research, Elsevier, vol. 112(3), pages 673-681, February.
    3. Fred Glover, 1975. "Surrogate Constraint Duality in Mathematical Programming," Operations Research, INFORMS, vol. 23(3), pages 434-451, June.
    4. Johri, Pravin K., 1996. "Implied constraints and an alternate unified development of nonlinear programming theory," European Journal of Operational Research, Elsevier, vol. 88(3), pages 537-549, February.
    5. Harvey J. Greenberg & William P. Pierskalla, 1970. "Surrogate Mathematical Programming," Operations Research, INFORMS, vol. 18(5), pages 924-939, October.
    6. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 1997. "Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 611-625, November.
    7. Johri, Pravin K., 1993. "Implied constraints and a unified theory of duality in linear and nonlinear programming," European Journal of Operational Research, Elsevier, vol. 71(1), pages 61-69, November.
    Full references (including those not matched with items on IDEAS)

    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. Johri, Pravin K., 1996. "Implied constraints and an alternate unified development of nonlinear programming theory," European Journal of Operational Research, Elsevier, vol. 88(3), pages 537-549, February.
    2. Johri, Pravin K., 1999. "Implied constraints and LP duals of general nonlinear programming problems," European Journal of Operational Research, Elsevier, vol. 112(3), pages 673-681, February.
    3. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    4. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    5. Alidaee, Bahram, 2014. "Zero duality gap in surrogate constraint optimization: A concise review of models," European Journal of Operational Research, Elsevier, vol. 232(2), pages 241-248.
    6. Andre, Francisco J. & Riesgo, Laura, 2007. "A non-interactive elicitation method for non-linear multiattribute utility functions: Theory and application to agricultural economics," European Journal of Operational Research, Elsevier, vol. 181(2), pages 793-807, September.
    7. Selcuk Karabati & Panagiotis Kouvelis & Gang Yu, 2001. "A Min-Max-Sum Resource Allocation Problem and Its Applications," Operations Research, INFORMS, vol. 49(6), pages 913-922, December.
    8. Ablanedo-Rosas, José H. & Rego, César, 2010. "Surrogate constraint normalization for the set covering problem," European Journal of Operational Research, Elsevier, vol. 205(3), pages 540-551, September.
    9. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    10. André, Francisco J., 2009. "Indirect elicitation of non-linear multi-attribute utility functions. A dual procedure combined with DEA," Omega, Elsevier, vol. 37(4), pages 883-895, August.
    11. Chandra Ade Irawan & Dylan Jones, 2019. "Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities," Annals of Operations Research, Springer, vol. 272(1), pages 41-67, January.
    12. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    13. Tang, Lixin & Liu, Guoli, 2007. "A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1453-1468, November.
    14. Siddhartha Syam & Bala Shetty, 1998. "Coordinated replenishments from multiple suppliers with price discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 579-598, September.
    15. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    17. Saïd Hanafi & Christophe Wilbaut, 2011. "Improved convergent heuristics for the 0-1 multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 183(1), pages 125-142, March.
    18. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    19. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    20. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:117:y:1999:i:1:p:183-196. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.