retagged by
583 views
1 votes
1 votes
  1. The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations. 

    The transportation problem implied by this table can also be written in the form

    $$\text{minimize} \: \: \underline{c} \: ^T \: \underline{x}$$

    $$\text{subject to :}  \: \: Ax= \underline{b}$$

    $$ \underline{x} \geq 0$$

    Display $\underline{c} \: ^T , A$ and $\underline{b}$ if $\underline{x}$ is the vector

    (XAF, XAG, XAH, XAH, XBF, XBG, XBH, XCF, XCG, XCH)

    Where $x_{ij}$ represents the shipment from $i$ to $j$.
  2. Given that XAG, XBH, XCF, XC are the variable in the basis, solve for the values of these variables in the above question(i).

  3. For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.

retagged by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
go_editor asked Dec 11, 2016
382 views
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
1 votes
1 votes
0 answers
3
go_editor asked Dec 10, 2016
395 views
An $8212$ in handshake mode of implementation is used in a device controller of a microprocessor-based system. The $8212$ control signals used for the purpose of handshak...
2 votes
2 votes
1 answer
4
go_editor asked Dec 10, 2016
768 views
If the total number of states in the fetching and execution phases of an $8085$ instruction is known to be $7,$ number of states in these machine cycles is divided as ___...