Skip to main content
Log in

Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming

  • Published:
Russian Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. A. S. Antipin, “Inverse Optimization Problems: Problem Definition and Approaches to Solution,” in Inverse Problems of Mathematical Programming (VTs RAN, Moscow, 1992), pp. 3–33.

    Google Scholar 

  2. E. S. Levitin, “The Mathematical Programming Problems with Constraints of the Extremal Type,” in Inverse Problems of Mathematical Programming (VTs RAN, Moscow, 1992), pp. 102–132.

    Google Scholar 

  3. V. P. Bulatov, Immersion Methods in Optimization Problems (Nauka, Novosibirsk, 1977) [in Russian].

    Google Scholar 

  4. V. P. Bulatov, “Solution Methods for Multiextremal Problems,” in Methods of Numeric Analysis and Optimization (Nauka, Novosibirsk, 1987), pp. 133–157.

    Google Scholar 

  5. V. P. Bulatov and O. V. Khamisov, “The Branch and Bound Method with Cuts in E n+1 for Solving Concave Programming Problem,” Lecture Notes in Control and Informat. Sci. 180, 273–281 (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © V.P. Bulatov, T.I. Belykh, 2007, published in Izvestiya Vysshikh Uchebnykh Zavedenii Matematika, 2007, No. 6, pp. 14–20.

About this article

Cite this article

Bulatov, V.P., Belykh, T.I. Numerical solution methods for multiextremal problems connected with inverse problems in mathematical programming. Russ Math. 51, 11–17 (2007). https://doi.org/10.3103/S1066369X07060023

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X07060023

Keywords

Navigation