tx · 7RV1Z74eVmtCUgquDV471YshP4SCEwvoDFZTJfycDVP9

3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV:  -0.00500000 Waves

2023.09.07 10:16 [2744651] data 3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV > SELF 0.00000000 Waves

3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_result: " Linear programming (LP) is a mathematical optimization technique used to determine the best outcome from a set of available resources. It involves maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. LP problems are often used in decision-making, production planning, resource allocation, and scheduling. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function." -> null

{ "type": 12, "id": "7RV1Z74eVmtCUgquDV471YshP4SCEwvoDFZTJfycDVP9", "fee": 500000, "feeAssetId": null, "timestamp": 1694071032231, "version": 2, "chainId": 84, "sender": "3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV", "senderPublicKey": "DS6HkopS9zypvxX6VhkdNvv6v4wcPZuChRvTwKJeacxE", "proofs": [ "6s4uru4CNaKriYMcfu41foPpBSUVkgfDyNpVExkENmofc6uSYB7kWsTE8T6ymvQQgimxZ4s8oc7zLGY6jqxVieG" ], "data": [ { "key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_result", "value": null } ], "height": 2744651, "applicationStatus": "succeeded", "spentComplexity": 0 }

github/deemru/w8io/169f3d6 
15.74 ms