Ask a Question

Solve the following linear programming problem by simplex method    

0 votes
68 views
asked in IM&OR by (215k points)

Solve the following linear programming problem by simplex method                                           

Maximize 4x1 + 6x2 + x3

Subject to 2x1–x2 + 3x3 $\leq$ 5

X1,X2$\geq$ 0

      What is the solution to the above problem?

    

Please log in or register to answer this question.

Related questions

Welcome to Q&A discussion forum, where you can ask questions and receive answers from other members of the community.

Categories

Most popular tags

10.4k questions

274 answers

26 comments

14.6k users

Snow Theme by Q2A Market
Powered by Adapala Academy
...