run Prettier

ProvideQ · Mar 28, 2024 · 12db9a1 · 12db9a1
1 parent d9a96de
commit 12db9a1
Show file tree

Hide file tree

Showing 2 changed files with 18 additions and 19 deletions.
diff --git a/src/components/landing-page/ProblemChooser.tsx b/src/components/landing-page/ProblemChooser.tsx
@@ -40,14 +40,13 @@ export const ProblemChooser = (props: GridProps) => (
       />
     </GridItem>
     <GridItem>
-        <ProblemCard
-          href="solve/LP"
-          new={true}
-          tags={["QAOA"]}
-          problemName="LP"
-          description="Optimize a linear objective function with real-valued variables under linear constraints."
-        />
-</GridItem>
-
+      <ProblemCard
+        href="solve/LP"
+        new={true}
+        tags={["QAOA"]}
+        problemName="LP"
+        description="Optimize a linear objective function with real-valued variables under linear constraints."
+      />
+    </GridItem>
   </Grid>
 );
diff --git a/src/pages/solve/LP.tsx b/src/pages/solve/LP.tsx
@@ -1,4 +1,4 @@
-import { Code, Divider, Heading, Spacer, Text } from "@chakra-ui/react";
+import { Divider, Heading, Spacer, Text } from "@chakra-ui/react";
 import type { NextPage } from "next";
 import Head from "next/head";
 import { useState } from "react";
@@ -19,15 +19,15 @@ const LP: NextPage = () => {
       </Head>
 
       <Heading as="h1">LP Solver</Heading>
-        <Text color="text" align="justify">
-            In the Linear Programming (LP) problem, we seek to optimize a linear
-            objective function subject to a set of linear equality and inequality
-            constraints. The objective function and constraints are expressed in terms of
-            decision variables, which can assume any real values. The problem statement is
-            formulated in the LP format, and solvers will provide an optimal variable
-            assignment as a solution, aiming to maximize or minimize the objective
-            function while satisfying all constraints.
-        </Text>
+      <Text color="text" align="justify">
+        In the Linear Programming (LP) problem, we seek to optimize a linear
+        objective function subject to a set of linear equality and inequality
+        constraints. The objective function and constraints are expressed in
+        terms of decision variables, which can assume any real values. The
+        problem statement is formulated in the LP format, and solvers will
+        provide an optimal variable assignment as a solution, aiming to maximize
+        or minimize the objective function while satisfying all constraints.
+      </Text>
 
       <Spacer />