tx · 96PiixV8bJJUBYQ2GZ7p6LGxXyyQTBYsQoJhUMzgEtPo
3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL: -0.00500000 Waves
2023.08.13 22:21 [2709201] invoke 3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL > 3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV commitTask()
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: checked_out_orca_BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_by_92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97: null == null
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_timestamp: 1691954374927 -> 1691954473738
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_height: 2709199 -> 2709201
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, transportation scheduling, and resource allocation. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function." -> " 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 scenarios where resource allocation, production planning, and scheduling are concerned. The goal of LP is to find the optimal value of a linear objective function that satisfies all the given constraints."
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_status: "done" == "done"
{
"type": 16,
"id": "96PiixV8bJJUBYQ2GZ7p6LGxXyyQTBYsQoJhUMzgEtPo",
"fee": 500000,
"feeAssetId": null,
"timestamp": 1691954414503,
"version": 2,
"chainId": 84,
"sender": "3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL",
"senderPublicKey": "92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97",
"proofs": [
"3HMEnwk6PF7RHteivFfsfcTiskochJMaCqzDbdHz1gqLPgPuf8ffPViYHifgRNtioE8crGRpqEVXQ6eXr6UNcHHz"
],
"dApp": "3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV",
"payment": [],
"call": {
"function": "commitTask",
"args": [
{
"type": "string",
"value": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp"
},
{
"type": "string",
"value": " 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 scenarios where resource allocation, production planning, and scheduling are concerned. The goal of LP is to find the optimal value of a linear objective function that satisfies all the given constraints."
}
]
},
"height": 2709201,
"applicationStatus": "succeeded",
"spentComplexity": 48,
"stateChanges": {
"data": [
{
"key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_status",
"type": "string",
"value": "done"
},
{
"key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_result",
"type": "string",
"value": " 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 scenarios where resource allocation, production planning, and scheduling are concerned. The goal of LP is to find the optimal value of a linear objective function that satisfies all the given constraints."
},
{
"key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_height",
"type": "integer",
"value": 2709201
},
{
"key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_timestamp",
"type": "integer",
"value": 1691954473738
},
{
"key": "checked_out_orca_BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_by_92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97",
"value": null
}
],
"transfers": [],
"issues": [],
"reissues": [],
"burns": [],
"sponsorFees": [],
"leases": [],
"leaseCancels": [],
"invokes": []
}
}
