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

Implied constraints and an alternate unified development of nonlinear programming theory

Author

Listed:
  • Johri, Pravin K.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:3:p:537-549
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00253-3
    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. Harvey J. Greenberg & William P. Pierskalla, 1970. "Surrogate Mathematical Programming," Operations Research, INFORMS, vol. 18(5), pages 924-939, October.
    3. 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.
    4. M. S. Bazaraa & J. J. Goode & C. M. Shetty, 1972. "Constraint Qualifications Revisited," Management Science, INFORMS, vol. 18(9), pages 567-573, May.
    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. 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.
    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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    7. 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.
    8. 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.
    9. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    10. Stanley Baiman & Jerrold H. May & Arijit Mukherji, 1990. "Optimal employment contracts and the returns to monitoring in a principal†agent context," Contemporary Accounting Research, John Wiley & Sons, vol. 6(2), pages 761-799, March.
    11. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    12. Satoshi Suzuki & Daishi Kuroiwa, 2012. "Necessary and Sufficient Constraint Qualification for Surrogate Duality," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 366-377, February.
    13. Polyxeni-Margarita Kleniati & Claire Adjiman, 2014. "Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development," Journal of Global Optimization, Springer, vol. 60(3), pages 425-458, November.
    14. R. Christopher L. Riley & Cesar Rego, 2019. "Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling," Journal of Heuristics, Springer, vol. 25(4), pages 793-807, October.
    15. Francisco J. André & Laura Riesgo, 2006. "A Duality Procedure to Elicit Nonlinear Multiattribute Utility Functions," Working Papers 06.02, Universidad Pablo de Olavide, Department of Economics.
    16. 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.
    17. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    18. 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.
    19. 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.
    20. Satoshi Suzuki & Daishi Kuroiwa, 2020. "Duality Theorems for Convex and Quasiconvex Set Functions," SN Operations Research Forum, Springer, vol. 1(1), pages 1-13, 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:88:y:1996:i:3:p:537-549. 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.