Skip to main content
Log in

Discrete optimization in partially ordered sets

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The primary aim of this article is to resolve a global optimization problem in the setting of a partially ordered set that is equipped with a metric. Indeed, given non-empty subsets A and B of a partially ordered set that is endowed with a metric, and a non-self mapping \({S : A \longrightarrow B}\), this paper discusses the existence of an optimal approximate solution, designated as a best proximity point of the mapping S, to the equation Sx = x, where S is a proximally increasing, ordered proximal contraction. An algorithm for determining such an optimal approximate solution is furnished. Further, the result established in this paper realizes an interesting fixed point theorem in the setting of partially ordered set as a special case.

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.

Similar content being viewed by others

References

  1. DeMarr R.: Common fixed points for isotone mappings. Colloquium Math. 13, 45–48 (1964)

    Google Scholar 

  2. Diviccaro M.L.: Common fixed points of commutative antitone operators in partially ordered sets. Radovi Math. 12, 123–128 (2004)

    Google Scholar 

  3. Diviccaro M.L.: Fixed point properties of decomposable isotone operators in posets. Sarajevo J. Math. 13, 5–10 (2005)

    Google Scholar 

  4. Diviccaro M.L., Sessa S.: Common fixed points of increasing operators in posets and related semilattice properties. Int. Math. Forum 3(43), 2123–2128 (2008)

    Google Scholar 

  5. Nieto J.J., Rodriguez-Lopez R.: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 22, 223–229 (2005)

    Article  Google Scholar 

  6. Ran A.C.M., Reurings M.C.B.: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 132, 1435–1443 (2004)

    Article  Google Scholar 

  7. Eldred, A.A., Veeramani, P.: On best proximity pair solutions with applications to differential equations. J. Indian Math. Soc. (N.S.) 2007, special volume on the occasion of the centenary year of IMS (1907–2007), 51–62 (2008)

  8. Floudas C.A., Pardalos P.M.: State of the Art in Global Optimization: Computational Methods and Applications. Springer, Berlin (1996)

    Book  Google Scholar 

  9. Floudas C.A., Pardalos P.M.: Frontiers in Global Optimization. Springer, Berlin (2003)

    Book  Google Scholar 

  10. Floudas C.A., Pardalos P.M.: Encyclopedia of Optimization, 2nd edn. Springer, Berlin (2009)

    Book  Google Scholar 

  11. Basha S.S., Veeramani P.: Best proximity pair theorems for multifunctions with open fibres. J. Approx. Theory 103, 119–129 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Sadiq Basha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Basha, S.S. Discrete optimization in partially ordered sets. J Glob Optim 54, 511–517 (2012). https://doi.org/10.1007/s10898-011-9774-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9774-2

Keywords

Navigation