Scholars Central

Review articlePublished Aug 2013

GOAL GEOMETRIC PROGRAMMING PROBLEM (G2 P2) WITH CRISP AND IMPRECISE TARGETS

Authors: Payel Ghosh, Tapan Kumar Roy

Journal of Global Research in Computer Sciences

Volume 4 · Issue 8 · Pages 21–29

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

There are very common and widely used forms of solving linear and non-linear Goal Programming Problem. They are Archimedean, Lexicographic and MINMAX etc. This paper proposes a Geometric Programming method to solve a non-linear Goal Programming Problem. In particular, it demonstrates a new approach goal geometric programming in both crisp and imprecise environment. There is a numerical example and also an application of this method in two-bar truss problem. Comparison with Kuhn-Tucker conditions and crisp goal geometric programming method in the numerical example, it shows the efficiency of this method. In this paper, we have described fuzzy goal geometric programming and also implemented it on the same numerical example like crisp goal geometric programming and two bar truss problem.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Payel Ghosh”
  • BylineArticles whose byline prints “Tapan Kumar Roy”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels